Approximation Algorithms: Good Solutions to Hard Problems

DOI10.2307/2974860MaRDI QIDQ4698461zbMATH OpenOpenAlexFDO

Authors Ran Libeskind-Hadas

Publication date 4 May 1995

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1966&context=hmc_fac_pub

zbMATH Keywords

approximation algorithmsvertex cover problemNP-complete problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A study on the efficient approximation algorithms for NP-complete problems
• Publication:4725744
• scientific article; zbMATH DE number 3902037
• scientific article; zbMATH DE number 2159272
• Optimization, approximation, and complexity classes

Cited in

(3)

• Approximation algorithms for NP-hard problems
• Fixed-Parameter and Approximation Algorithms: A New Look
• A study on the efficient approximation algorithms for NP-complete problems

This page was built for publication: Approximation Algorithms: Good Solutions to Hard Problems

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