skip to main content
10.1145/1132516.1132609acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree

Published: 21 May 2006 Publication History

Abstract

In the multi-commodity rent-or-buy network design problem (MRoB) we are given a network together with a set of k terminal pairs R = (s_1, t_1), ..., (s_k, t_k). The goal is to install capacities on the edges of the network so that a prescribed amount of flow fi can be routed between all terminal pairs si and ti simultaneously. We can either rent capacity on an edge at some cost per unit flow or buy infinite capacity on an edge at some larger fixed cost. The overall objective is to install capacities at a minimum total cost.The version of the stochastic Steiner tree problem (SST) considered here is the Steiner tree problem in the model of two-stage stochastic optimization with recourse. In stage one, there is a known probability distribution on subsets of vertices and we can choose to buy a subset of edges at a given cost. In stage two, a subset of vertices T from the prior known distribution is realized, and additional edges can be bought at a possibly higher cost. The objective is to buy a set of edges in stages one and two so that all vertices in T are connected, and the expected cost is minimized.Gupta et al. (FOCS '03) give a randomized scheme for the MRoB problem that was both used subsequently to improve the approximation ratio for this problem, and extended to yield the best approximation algorithm for SST. One building block of this scheme is a good approximation algorithm for Steiner forests.We present a surprisingly simple 5-approximation algorithm for MRoB and 6-approximation for SST, improving on the best previous guarantees of 6.828 and 12.6, and show that no approximation ratio better than 4.67 can be achieved using the above mentioned randomized scheme in combination with the currently best known Steiner forest approximation algorithms. A key component of our approach are cost shares that are 3-strict for the unmodified primal-dual Steiner forest algorithm.

References

[1]
M. Andrews. Hardness of buy-at-bulk network design. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 115--124, 2004.
[2]
B. Awerbuch and Y. Azar. Buy-at-bulk network design. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 542--547, 1997.
[3]
A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem in networks. SIAM J. Comput., 24:440--456, 1995.
[4]
Y. Bartal. Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 184--193, 1996.
[5]
Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings, ACM Symposium on Theory of Computing, pages 161--168, 1998.
[6]
L. Becchetti, J. Könemann, S. Leonardi, and M. Pál. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pages 375--384, 2005.
[7]
M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett., 32(4):171--176, 1989.
[8]
J. Fakcharoenphol, S. Rao and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings, ACM Symposium on Theory of Computing, pages 448--455, 2003.
[9]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
[10]
A. Gupta, A. Kumar, M. Pál, and T. Roughgarden. Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 606--617, 2003.
[11]
A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings, ACM Symposium on Theory of Computing, pages 365--372, 2003.
[12]
A. Gupta and M. Pál. Stochastic Steiner trees without a root. In Proceedings, International Colloquium on Automata, Languages and Programming, pages 1051--1063, 2005.
[13]
A. Gupta, M. Pál, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings, ACM Symposium on Theory of Computing, pages 417--426, 2004.
[14]
A. Gupta, R. Ravi, and A. Sinha. An edge in time saves nine: LP rounding approximation algorithms. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 218--227, 2004.
[15]
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24:296--317, 1995.
[16]
A. Kumar, A. Gupta, and T. Roughgarden. A constant factor approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 333--344, 2002.

Cited By

View all
  • (2017)On Critical Service Recovery After Massive Network FailuresIEEE/ACM Transactions on Networking10.1109/TNET.2017.268833025:4(2235-2249)Online publication date: 1-Aug-2017
  • (2016)Network Recovery After Massive Failures2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN.2016.18(97-108)Online publication date: Jun-2016
  • (2016)Steiner ForestEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_402(2099-2102)Online publication date: 22-Apr-2016
  • Show More Cited By

Index Terms

  1. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximation algorithms
    2. cost sharing
    3. stochastic optimization

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)3
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)On Critical Service Recovery After Massive Network FailuresIEEE/ACM Transactions on Networking10.1109/TNET.2017.268833025:4(2235-2249)Online publication date: 1-Aug-2017
    • (2016)Network Recovery After Massive Failures2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN.2016.18(97-108)Online publication date: Jun-2016
    • (2016)Steiner ForestEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_402(2099-2102)Online publication date: 22-Apr-2016
    • (2011)Deterministic Sampling Algorithms for Network DesignAlgorithmica10.5555/3118746.311892160:1(110-151)Online publication date: 1-May-2011
    • (2011)Approximation algorithms for single and multi-commodity connected facility locationProceedings of the 15th international conference on Integer programming and combinatoral optimization10.5555/2018158.2018178(248-260)Online publication date: 15-Jun-2011
    • (2011)From Uncertainty to NonlinearityMathematics of Operations Research10.1287/moor.1110.049036:2(185-204)Online publication date: 1-May-2011
    • (2011)Approximation Algorithms for Single and Multi-Commodity Connected Facility LocationInteger Programming and Combinatoral Optimization10.1007/978-3-642-20807-2_20(248-260)Online publication date: 2011
    • (2010)Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal PreprocessingAlgorithmica10.5555/3118221.311839656:4(529-549)Online publication date: 1-Apr-2010
    • (2010)Network design via core detouring for problems without a coreProceedings of the 37th international colloquium conference on Automata, languages and programming10.5555/1880918.1880972(490-502)Online publication date: 6-Jul-2010
    • (2010)Connected facility location via random facility sampling and core detouringJournal of Computer and System Sciences10.1016/j.jcss.2010.02.00176:8(709-726)Online publication date: 1-Dec-2010
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media