Inapproximability of combinatorial optimization problems
From MaRDI portal
Recommendations
- Approximability of hard combinatorial optimization problems: an introduction
- scientific article; zbMATH DE number 1775419
- On the hardness of approximating minimization problems
- scientific article; zbMATH DE number 1330033
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
Cited in
(24)- Minimum weakly fundamental cycle bases are hard to find
- Approximability of hard combinatorial optimization problems: an introduction
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- NP-completeness of a combinator optimization problem
- Smooth and strong PCPs
- Complexity and approximability of parameterized MAX-CSPs
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- On estimation algorithms vs approximation algorithms
- scientific article; zbMATH DE number 4155842 (Why is no real title available?)
- Approximative Algorithmen und Nichtapproximierbarkeit
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- Approximation algorithms
- scientific article; zbMATH DE number 1944142 (Why is no real title available?)
- scientific article; zbMATH DE number 1775419 (Why is no real title available?)
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- scientific article; zbMATH DE number 780787 (Why is no real title available?)
- Combinatorial dominance guarantees for problems with infeasible solutions
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
- On the approximability of the minimum weight t-partite clique problem
- Parallel repetition of two-prover one-round games: an exposition
- Product-state approximations to quantum states
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Rigid matrices from rectangular PCPs
- Hard constraint satisfaction problems have hard gaps at location 1
This page was built for publication: Inapproximability of combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059320)
