PASS Approximation

DOI10.1007/978-3-642-03685-9_9MaRDI QIDQ3638872zbMATH OpenOpenAlexFDO

Authors Nicole Immorlica, Hamid Nazerzadeh, Vahab S. Mirrokni, Uriel Feige

Publication date 28 October 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03685-9_9

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete location and assignment (90B80) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• PASS approximation: a framework for analyzing and designing heuristics
• scientific article; zbMATH DE number 1342123
• On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
• The power of priority algorithms for facility location and set cover
• scientific article; zbMATH DE number 1303608

Cited in

(2)

• PASS approximation: a framework for analyzing and designing heuristics
• Simultaneous selection

This page was built for publication: PASS Approximation

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