The approximability of NP-hard problems
Sanjeev Arora · 1998
Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical”