{
  "name": "Approximation guarantees and hardness bounds for classic optimisation problems",
  "description": "Compiled from two university lecture-note sets on approximation algorithms (UIUC CS583 and Cornell CS 6820). Each row pairs a problem with an algorithm, its proven guarantee and the stated limit on what any polynomial-time algorithm can achieve.",
  "page": "https://casrai.org/guides/approximation-algorithms",
  "publisher": "CASRAI",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "dateModified": "2026-11-15T14:50:14Z",
  "temporalCoverage": "2016/2021",
  "spatialCoverage": null,
  "columns": [
    {
      "name": "Problem",
      "unit": "",
      "description": ""
    },
    {
      "name": "Objective",
      "unit": "",
      "description": ""
    },
    {
      "name": "Algorithm",
      "unit": "",
      "description": ""
    },
    {
      "name": "Proven guarantee",
      "unit": "",
      "description": ""
    },
    {
      "name": "Stated limit on any polynomial-time algorithm",
      "unit": "",
      "description": ""
    },
    {
      "name": "Source",
      "unit": "",
      "description": ""
    }
  ],
  "rows": [
    {
      "Problem": "Vertex cover",
      "Objective": "Minimise",
      "Algorithm": "Maximal matching, take both endpoints",
      "Proven guarantee": "2-approximation",
      "Stated limit on any polynomial-time algorithm": "No ratio below 1.36 unless P = NP; no 2 - epsilon under the Unique Games Conjecture",
      "Source": "UIUC CS583"
    },
    {
      "Problem": "Weighted vertex cover",
      "Objective": "Minimise",
      "Algorithm": "LP relaxation rounding (include vertices with x_v at least 1/2)",
      "Proven guarantee": "2-approximation",
      "Stated limit on any polynomial-time algorithm": "Same limits as vertex cover",
      "Source": "Cornell CS 6820"
    },
    {
      "Problem": "Set cover",
      "Objective": "Minimise",
      "Algorithm": "Greedy (most uncovered elements per step)",
      "Proven guarantee": "ln n + 1",
      "Stated limit on any polynomial-time algorithm": "No (1 - o(1)) ln n approximation (Feige); holds under P != NP",
      "Source": "UIUC CS583"
    },
    {
      "Problem": "Weighted set cover",
      "Objective": "Minimise",
      "Algorithm": "Greedy (minimum weight per newly covered element)",
      "Proven guarantee": "1 + ln(max set size)",
      "Stated limit on any polynomial-time algorithm": "Not stated in the note set for this row",
      "Source": "Cornell CS 6820"
    },
    {
      "Problem": "Maximum coverage",
      "Objective": "Maximise",
      "Algorithm": "Not stated in the note set for this row",
      "Proven guarantee": "Not stated in the note set for this row",
      "Stated limit on any polynomial-time algorithm": "No (1 - 1/e - epsilon) approximation unless P = NP",
      "Source": "UIUC CS583"
    },
    {
      "Problem": "Max-Cut",
      "Objective": "Maximise",
      "Algorithm": "Randomised assignment of vertices to sides",
      "Proven guarantee": "Ratio 2 (expected value, second convention)",
      "Stated limit on any polynomial-time algorithm": "Not stated in the note set for this row",
      "Source": "Cornell CS 6820"
    },
    {
      "Problem": "Max-Cut",
      "Objective": "Maximise",
      "Algorithm": "Semidefinite programming relaxation with rounding",
      "Proven guarantee": "About 0.878 (about 1.14 in the second convention)",
      "Stated limit on any polynomial-time algorithm": "Not stated in the note set for this row",
      "Source": "Cornell CS 6820"
    },
    {
      "Problem": "k-center",
      "Objective": "Minimise",
      "Algorithm": "Not stated in the note set for this row",
      "Proven guarantee": "2-approximation",
      "Stated limit on any polynomial-time algorithm": "No (2 - epsilon) approximation",
      "Source": "UIUC CS583"
    }
  ],
  "sources": [
    {
      "title": "Chekuri, Approximation algorithms lecture notes, CS 583, UIUC, Fall 2021",
      "url": "https://courses.grainger.illinois.edu/cs583/fa2021/approx-algorithms-lecture-notes.pdf",
      "accessed": "2026-11-15"
    },
    {
      "title": "Cornell CS 6820 (Fall 2016) approximation algorithms handout",
      "url": "https://www.cs.cornell.edu/courses/cs6820/2016fa/handouts/approx_algs.pdf",
      "accessed": "2026-11-15"
    }
  ]
}