Chapter

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Volume 5687 of the series Lecture Notes in Computer Science pp 111-124

PASS Approximation

A Framework for Analyzing and Designing Heuristics
  • Uriel FeigeAffiliated withWeizmann Institute
  • , Nicole ImmorlicaAffiliated withNorthwestern University
  • , Vahab S. MirrokniAffiliated withGoogle Research
  • , Hamid NazerzadehAffiliated withStanford University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We introduce a new framework for designing and analyzing algorithms. Our framework applies best to problems that are inapproximable according to the standard worst-case analysis. We circumvent such negative results by designing guarantees for classes of instances, parameterized according to properties of the optimal solution. We also make sure that our parameterized approximation, called PArametrized by the Signature of the Solution (PASS) approximation, is the best possible. We show how to apply our framework to problems with additive and submodular objective functions such as the capacitated maximum facility location problems. We consider two types of algorithms for these problems. For greedy algorithms, our framework provides a justification for preferring a certain natural greedy rule over some alternative greedy rules that have been used in similar contexts. For LP-based algorithms, we show that the natural LP relaxation for these problems is not optimal in our framework. We design a new LP relaxation and show that this LP relaxation coupled with a new randomized rounding technique is optimal in our framework.

In passing, we note that our results strictly improve over previous results of Kleinberg, Papadimitriou and Raghavan [JACM 2004] concerning the approximation ratio of the greedy algorithm.