Back to Results
First PageMeta Content
Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Approximation algorithms / Combinatorial optimization / Set cover problem / Linear programming relaxation / Greedy algorithm / Facility location problem / Reduction


PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡
Add to Reading List

Document Date: 2009-09-15 22:21:32

Open Document

File Size: 295,58 KB

Share Result on Facebook