IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v16y2008i4d10.1007_s10878-008-9150-4.html
   My bibliography  Save this article

Packing trees in communication networks

Author

Listed:
  • Mohamed Saad

    (University of Sharjah)

  • Tamás Terlaky

    (McMaster University)

  • Anthony Vannelli

    (University of Guelph)

  • Hu Zhang

    (Canadian Imperial Bank of Commerce)

Abstract

Given an undirected edge-capacitated graph and given (possibly) different subsets of vertices, we consider the problem of selecting a maximum (weighted) set of Steiner trees, each tree spanning a subset of vertices, without violating the capacity constraints. This problem is motivated by applications in multicast communication networks. We give an integer linear programming (ILP) formulation for the problem, and observe that its linear programming (LP) relaxation is a fractional packing problem with exponentially many variables and a block (sub-)problem that cannot be solved in polynomial time. To this end, we take an r-approximate block solver (a weak block solver) to develop a (1−ε)/r-approximation algorithm for the LP relaxation. The algorithm has a polynomial coordination complexity for any ε∈(0,1). To the best of our knowledge, this is the first approximation result for fractional packing problems with only weak block solvers (with arbitrarily large approximation ratio) and a coordination complexity that is polynomial in the input size. This leads also to an approximation algorithm for the underlying tree packing problem. Finally, we extend our results to an important multicast routing and wavelength assignment problem in optical networks, where each Steiner tree is to be assigned one of a limited set of given wavelengths, so that trees crossing the same fiber are assigned different wavelengths.

Suggested Citation

  • Mohamed Saad & Tamás Terlaky & Anthony Vannelli & Hu Zhang, 2008. "Packing trees in communication networks," Journal of Combinatorial Optimization, Springer, vol. 16(4), pages 402-423, November.
    • Handle: RePEc:spr:jcomop:v:16:y:2008:i:4:d:10.1007_s10878-008-9150-4
    DOI: 10.1007/s10878-008-9150-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9150-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-008-9150-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Serge A. Plotkin & David B. Shmoys & Éva Tardos, 1995. "Fast Approximation Algorithms for Fractional Packing and Covering Problems," Mathematics of Operations Research, INFORMS, vol. 20(2), pages 257-301, May.
    2. Guohui Lin, 2005. "An Improved Approximation Algorithm for Multicast k-Tree Routing," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 349-356, June.
    3. Michael D. Grigoriadis & Leonid G. Khachiyan, 1996. "Coordination Complexity of Parallel Price-Directive Decomposition," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 321-340, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Klaus Jansen & Lorant Porkolab, 2001. "Improved Approximation Schemes for Scheduling Unrelated Parallel Machines," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 324-338, May.
    2. Michael Holzhauser & Sven O. Krumke, 2018. "A generalized approximation framework for fractional network flow and packing problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 19-50, February.
    3. Barbara Anthony & Vineet Goyal & Anupam Gupta & Viswanath Nagarajan, 2010. "A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 79-101, February.
    4. Amitai Armon & Iftah Gamzu & Danny Segev, 2014. "Mobile facility location: combinatorial filtering via weighted occupancy," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 358-375, August.
    5. Evgeny Shchepin & Nodari Vakhania, 2006. "An absolute approximation algorithm for scheduling unrelated machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 502-507, September.
    6. Jiaju Miao & Pawel Polak, 2023. "Online Ensemble of Models for Optimal Predictive Performance with Applications to Sector Rotation Strategy," Papers 2304.09947, arXiv.org.
    7. Alberto Caprara & Andrea Lodi & Michele Monaci, 2005. "Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 150-172, February.
    8. Shaojie Tang & Jing Yuan & Zhao Zhang & Ding-zhu Du, 2017. "iGreen: green scheduling for peak demand minimization," Journal of Global Optimization, Springer, vol. 69(1), pages 45-67, September.
    9. Yurii Nesterov, 2009. "Unconstrained Convex Minimization in Relative Scale," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 180-193, February.
    10. Jansen, Klaus & Mastrolilli, Monaldo & Solis-Oba, Roberto, 2005. "Approximation schemes for job shop scheduling problems with controllable processing times," European Journal of Operational Research, Elsevier, vol. 167(2), pages 297-319, December.
    11. José R. Correa & Asaf Levin, 2009. "Monotone Covering Problems with an Additional Covering Constraint," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 238-248, February.
    12. Maren Martens & Martin Skutella, 2009. "Flows with unit path capacities and related packing and covering problems," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 272-293, October.
    13. Freund, Yoav & Schapire, Robert E., 1999. "Adaptive Game Playing Using Multiplicative Weights," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 79-103, October.
    14. Luca Mencarelli & Youcef Sahraoui & Leo Liberti, 2017. "A multiplicative weights update algorithm for MINLP," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 31-86, March.
    15. Anupam Gupta & Marco Molinaro, 2016. "How the Experts Algorithm Can Help Solve LPs Online," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1404-1431, November.
    16. Lisa Fleischer & Michel X. Goemans & Vahab S. Mirrokni & Maxim Sviridenko, 2011. "Tight Approximation Algorithms for Maximum Separable Assignment Problems," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 416-431, August.
    17. Vianney Perchet, 2015. "Exponential Weight Approachability, Applications to Calibration and Regret Minimization," Dynamic Games and Applications, Springer, vol. 5(1), pages 136-153, March.
    18. Aharon Ben-Tal & Elad Hazan & Tomer Koren & Shie Mannor, 2015. "Oracle-Based Robust Optimization via Online Learning," Operations Research, INFORMS, vol. 63(3), pages 628-638, June.
    19. Erick Moreno-Centeno & Richard M. Karp, 2013. "The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment," Operations Research, INFORMS, vol. 61(2), pages 453-468, April.
    20. Yoav Freund & Robert E Shapire, 1997. "Game Theory, On-line Prediction and Boosting," Levine's Working Paper Archive 593, David K. Levine.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:16:y:2008:i:4:d:10.1007_s10878-008-9150-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.