Approximation Algorithms: Good Solutions to Hard Problems

DOI10.2307/2974860zbMath0822.90135OpenAlexW2084892028MaRDI QIDQ4698461

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

NP-complete problemsapproximation algorithmsvertex cover problem

Mathematics Subject Classification ID

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

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