Approximation algorithms

DOI10.1073/PNAS.94.24.12734MaRDI QIDQ4374975zbMATH OpenOpenAlexWikidataFDO

Authors Andreas S. Schulz, David B. Shmoys, David P. Williamson

Publication date 3 April 1998

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL http://www.pnas.org/cgi/content/abstract/94/24/12734

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Recommendations

• The design of approximation algorithms
• Publication:4725744
• scientific article; zbMATH DE number 780787
• Approximation algorithms. An introduction.
• Inapproximability of combinatorial optimization problems

Cites work

• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Cited in

(7)

• On Pseudodeterministic Approximation Algorithms.
• Approximation algorithms for NP-hard problems
• scientific article; zbMATH DE number 6381654 (Why is no real title available?)
• Verified Approximation Algorithms
• Approximation algorithms for \(k\)-hurdle problems
• Most relevant explanation: Computational complexity and approximation methods
• All-norm approximation algorithms

This page was built for publication: Approximation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374975)