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

First Page		Document Content
Date: 2009-09-15 22:21:32 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 Source URL: users.eecs.northwestern.edu Download Document from Source Website File Size: 295,58 KB Share Document on Facebook

	Greedy algorithm for large scale Nonnegative matrix/tensor decomposition ✦ DocID: 1tDWz - View Document
	The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗ DocID: 1sdbY - View Document
	Prof. Dr. Roger Wattenhofer phone +fax +Diploma/Master’s Thesis “Comparison of Ad Hoc Routing Algorithms” DocID: 1rmcF - View Document
	Advances in Cognitive SystemsSubmitted; publishedVariations on a Theory of Problem Solving Pat Langley DocID: 1r7U5 - View Document
	Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the pro DocID: 1qYO3 - View Document