Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2005: Mathematical Foundations of Computer Science 2005 pp 615–627Cite as

Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3618))

Abstract

We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This enables to significantly improve on the approximation ratios of these greedy methods, and gives a unified analysis of greedy for many packing problems. We show matching lower bounds on the ratios of such greedy methods. Applications to some specific problems, including mechanism design for combinatorial auctions, are also shown.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aharoni, R., Erdös, P., Linial, N.: Optima of dual linear programs. Combinatorica 8, 13–20 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, É.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, SODA (2003)

    Google Scholar 

  3. Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, p. 15. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Bartal, Y., Gonen, R., Nisan, N.: Incentive Compatible Multi-Unit Combinatorial Auctions. In: Proc. 9th conference on Theoretical Aspects of Rationality and Knowledge (TARK), Bloomington, IN, USA (June 2003)

    Google Scholar 

  5. Berman, P., Krysta, P.: Optimizing misdirection. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 192–201 (2003)

    Google Scholar 

  6. Briest, P., Krysta, P., Vöcking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: Proc. 37th ACM Symposium on Theory of Computing, STOC (2005)

    Google Scholar 

  7. Chekuri, C., Khanna, S.: Edge-disjoint paths revisited. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, SODA (2003)

    Google Scholar 

  8. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with non-negative data. Mathematics of Operations Research 7, 515–531 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gonen, R., Lehmann, D.J.: Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. In: Proc. 2nd ACM Conference on Electronic Commerce, EC (2000)

    Google Scholar 

  11. Gonen, R., Lehmann, D.J.: Linear Programming Helps Solve Large Multi-Unit Combinatorial Auctions. In: Proceedings of INFORMS 2001 (November 2001)

    Google Scholar 

  12. Guruswami, V., Khanna, S., Rajagopalan, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proc. 31st ACM Symposium on Theory of Computing, STOC (1999)

    Google Scholar 

  13. Halldórsson, M.M., Kratochvíl, J., Telle, J.A.: Independent sets with domination constraints. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 176. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Halldórsson, M.M.: A survey on independent set approximations. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 1–14. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Halldórsson, M.M.: Approximations of Weighted Independent Set and Hereditary Subset Problems. Journal of Graph Algorithms and Applications 4(1), 1–16 (2000)

    MathSciNet  Google Scholar 

  16. Hardy, G., Littlewood, J.E., Polya, G.: Inequalities, 2nd edn. Cambridge Univ. Press, Cambridge (1997)

    Google Scholar 

  17. Hastad, J.: Clique is hard to approximate within n 1 − ε. In: Proc. IEEE FOCS (1996)

    Google Scholar 

  18. Hazan, E., Safra, S., Schwartz, O.: On the hardness of approximating k-dimensional matching. In: Proc. APPROX. LNCS, Springer, Heidelberg (2003)

    Google Scholar 

  19. Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics 6, 243–254 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT (1996)

    Google Scholar 

  21. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 153–162. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Kolman, P.: A note on the greedy algorithm for the unsplittable flow problem. Information Processing Letters 88(3), 101–105 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, SODA (2002)

    Google Scholar 

  24. Lehmann, D., Ita O’Callaghan, L., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. In: Proc. 1st ACM Conference on Electronic Commerce, EC (1999); Journal version. Journal of the ACM 49(5), 577–602 (2002)

    Google Scholar 

  25. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383–390 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  26. Mu’alem, A., Nisan, N.: Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. In: Proc. 18th National AAAI Conference on Artificial Intelligence (2002)

    Google Scholar 

  27. Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences 37, 130–143 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  28. Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  29. Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing 28(2) (1998)

    Google Scholar 

  30. Srinivasan, A.: A extension of the Lovász Local Lemma and its applications to integer programming. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, SODA (1996)

    Google Scholar 

  31. Srinivasan, A.: Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing 29, 648–670 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Dortmund University, Baroper Str. 301, 44221, Dortmund, Germany

    Piotr Krysta

Authors
  1. Piotr Krysta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krysta, P. (2005). Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_53

Download citation

  • DOI: https://doi.org/10.1007/11549345_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation