KnowraApproximation algorithmLinked fromLinked fromThe 15 pages that link to Approximation algorithm, each with the reason it gives.All 15Broader topic 1Related 10Narrower topic 2Compared with 2Computational complexity theoryRelated: Approximation provides useful answers when exact optimization is computationally intractable.NP-completenessRelated: Hardness often motivates useful near-optimal solutions when exact optimization is intractable.Greedy algorithmRelated: When greedy choices are not exact, their quality may still admit a formal guarantee.Combinatorial optimizationRelated: Approximation guarantees offer tractable alternatives when exact optimization is too costly.NP-hardnessRelated: Approximation methods address optimization problems whose exact solutions are NP-hard to compute efficiently.Linear programming relaxationRelated: Rounding a relaxation's solution can yield an approximate discrete solution.Hamiltonian cycleRelated: For weighted tours, approximation methods address optimization when exact search is expensive.Clique problemRelated: The maximum-clique problem is difficult to approximate within strong guarantees.Erdős–Pósa theoremRelated: Packing and covering bounds can inform approximation methods for hitting cycles.Richard M. KarpRelated: Hardness results associated with Karp’s problems motivate approximate solutions.