Abstract
We define an algorithmic paradigm, the stack model, that captures most primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations. Hence our approximation bounds are independent of the P vs NP question. We provide tools to bound the performance of primal dual and local ratio algorithms and supply a (log n+1)/2 inapproximability result for set-cover, a 4/3 inapproximability for min steiner tree, and a 0.913 inapproximability for interval scheduling on two machines.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem on networks. SICOMP 24, 440–465 (1995)
Angelopoulos, S., Borodin, A.: The power of priority algorithms for facility location and set cover (2002)
Arkin, E.M., Silverberg, E.L.: Scheduling jobs with fixed start and end times. Disc. Appl. Math. 18, 1–8 (1987)
Arora, S., Bollobás, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: Proceedings of the 43rd Annual IEEE Conference on Foundations of Computer Science, pp. 313–322 (2002)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM 48(5), 1069–1090 (2001)
Bar-Yehuda, R., Bendel, A., Freund, A., Rawitz, D.: Local ratio: A unified framework for approxmation algorithms in memoriam: Shimon even 1935-2004. Computing Surveys 36, 422–463 (2004)
Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
Bar-Yehuda, R., Halldorsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 732–741 (2002)
Bar-Yehuda, R., Rawitz, D.: On the equivalence between the primal-dual schema and the local ratio technique. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 24–35. Springer, Heidelberg (2001)
Bar-Yehuda, R., Rawitz, D.: Using fractional primal-dual to schedule split intervals with demands (2004)
Borodin, A., Nielsen, M.N., Rackoff, C. (Incremental) priority algorithms. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002)
Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A., Pitassi, T.: Toward a model for backtracking and dynamic programming. Unpublished manuscript (2004)
Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (2004)
Erlebach, T., Spieksma, F.C.R.: Interval selection: Applications, algorithms, and lower bounds. Technical Report 152, Computer Engineering and Networks Laboratory, ETH (October 2002)
Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SICOMP 24, 296–317 (1995)
Jain, K., Vazirani, V.: Approximation algorithms for the metric facility location problem and k-median problem using the primal-dual schema and lagrangian relaxation. JACM 48, 274–299 (2001)
Klein, P., Ravi, R.: When cycles collapse: A general approximation technique for constrained two-connectivity problems. In: Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, pp. 39–55 (1993)
Rajagopalan, Vazirani: On the bidirected cut relaxation for the metric steiner tree problem. In: SODA, pp. 742–751 (1999)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability pcp characterization of np. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pp. 475–484 (1997)
Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA, pp. 770–779 (2001)
Saran, H., Vazirani, V., Young, N.: A primal-dual approach to approximation algorithms for network steiner problems. In: Proceedings of the Indo-US workshop on Cooperative Research in Computer Science, pp. 166–168 (1992)
Thimm, M.: On the approximability of the steiner tree problem. LNCS. Springer, Heidelberg (2001)
Vazirani, V.V.: Approximation algorithms. Springer, New York (2001)
Williamson, D.P.: The primal-dual method for approximation algorithms. Mathematical Programming, Series B 91(3), 447–478 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borodin, A., Cashman, D., Magen, A. (2005). How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_76
Download citation
DOI: https://doi.org/10.1007/11523468_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)