Approximation algorithms

DOI10.1073/PNAS.94.24.12734zbMath1053.90537OpenAlexW2578809778WikidataQ36156120 ScholiaQ36156120MaRDI QIDQ4374975

David B. Shmoys, Andreas S. Schulz, 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)

Related Items (1)

Approximation algorithms for \(k\)-hurdle problems

Cites Work

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

This page was built for publication: Approximation algorithms