Document Open Access Logo

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem

Authors Josefine Foos, Stephan Held , Yannik Kyle Dustin Spitzley

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2023.19.pdf
  • Filesize: 0.78 MB
  • 16 pages

Document Identifiers

Author Details

Josefine Foos
  • Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Germany
Stephan Held
  • Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Germany
Yannik Kyle Dustin Spitzley
  • Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Germany

Cite AsGet BibTex

Josefine Foos, Stephan Held, and Yannik Kyle Dustin Spitzley. Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.19

Abstract

Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or telecommunication networks. They are a special case of general cost-distance Steiner trees, where different distance functions are used for total length and path lengths. We improve the best published approximation factor for the uniform cost-distance Steiner tree problem from 2.39 [Khazraei and Held, 2021] to 2.05. If we can approximate the minimum-length Steiner tree problem arbitrarily well, our algorithm achieves an approximation factor arbitrarily close to 1+1/√2. This bound is tight in the following sense. We also prove the gap 1+1/√2 between optimum solutions and the lower bound which we and all previous approximation algorithms for this problem use. Similarly to previous approaches, we start with an approximate minimum-length Steiner tree and split it into subtrees that are later re-connected. To improve the approximation factor, we split it into components more carefully, taking the cost structure into account, and we significantly enhance the analysis.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
  • Theory of computation → Routing and network design problems
Keywords
  • cost-distance Steiner tree
  • approximation algorithm
  • uniform

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Sanjeev Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998. Google Scholar
  2. Marcelo P.L. Benedito, Lehilton L.C. Pedrosa, and Hugo K.K. Rosado. On the inapproximability of the cable-trench problem. Procedia Computer Science, 195:39-48, 2021. Google Scholar
  3. Jarosław Byrka, Fabrizio Grandoni, Thomas Rothvoss, and Laura Sanità. Steiner tree approximation via iterative randomized rounding. Journal of the ACM, 60(1):article 6, 2013. Google Scholar
  4. Chandra Chekuri, Sanjeev Khanna, and Joseph Naor. A deterministic algorithm for the cost-distance problem. In Proc. ACM-SIAM symposium on Discrete Algorithms (SODA '01), 2001, pages 232-233. SIAM, 2001. Google Scholar
  5. Miroslav Chlebík and Janka Chlebíková. The steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406(3):207-214, 2008. Google Scholar
  6. Julia Chuzhoy, Anupam Gupta, Joseph Naor, and Amitabh Sinha. On the approximability of some network design problems. ACM Transactions on Algorithms, 4(2):article 23, 2008. Google Scholar
  7. Siad Daboul, Stephan Held, Bento Natura, and Daniel Rotter. Global interconnect optimization. ACM Transactions on Design Automation of Electronic Systems, 2023. (to appear, conference paper in Proc. ICCAD '19). URL: https://doi.org/10.1145/3587044.
  8. Fabrizio Grandoni and Thomas Rothvoß. Network design via core detouring for problems without a core. In International Colloquium on Automata, Languages, and Programming, pages 490-502, 2010. Google Scholar
  9. Sudipto Guha, Adam Meyerson, and Kamesh Munagala. A constant factor approximation for the single sink edge installation problem. SIAM Journal on Computing, 38(6):2426-2442, 2009. Google Scholar
  10. Longkun Guo, Nianchen Zou, and Yidong Li. Approximating the shallow-light steiner tree problem when cost and delay are linearly dependent. In Proc. International Symposium on Parallel Architectures, Algorithms and Programming, pages 99-103, 2014. Google Scholar
  11. Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, and Jens Vygen. Global routing with timing constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 37(2):406-419, 2018. Google Scholar
  12. Stephan Held and Daniel Rotter. Shallow-light steiner arborescences with vertex delays. In Proc. International Conference on Integer Programming and Combinatorial Optimization (IPCO '13), pages 229-241, 2013. Google Scholar
  13. Stephan Held and Yannik.K.D. Spitzley. Further improvements on approximating the uniform cost-distance steiner tree problem. Technical report, Research Institute for Discrete Mathematics, University of Bonn, 2022. URL: https://arxiv.org/abs/2211.03830.
  14. Raja Jothi and Balaji Raghavachari. Improved approximation algorithms for the single-sink buy-at-bulk network design problems. Journal of Discrete Algorithms, 7(2):249-255, 2009. Google Scholar
  15. Ardalan Khazraei and Stephan Held. An improved approximation algorithm for the uniform cost-distance Steiner tree problem. In Proc. Workshop on Approximation and Online Algorithms (WAOA 2020), pages 189-203. Springer, 2021. Google Scholar
  16. Samir Khuller, Balaji Raghavachari, and Neal E. Young. Balancing minimum spanning trees and shortest-path trees. Algorithmica, 14(4):305-321, 1995. Google Scholar
  17. Adam Meyerson, Kamesh Munagala, and Serge Plotkin. Cost-distance: Two metric network design. SIAM Journal on Computing, 38(4):1648-1659, 2008. Google Scholar
  18. Daniel Rotter. Timing-constrained global routing with buffered Steiner trees. PhD thesis, Universitäts-und Landesbibliothek Bonn, 2017. Google Scholar
  19. Kunal Talwar. The single-sink buy-at-bulk lp has constant integrality gap. In International Conference on Integer Programming and Combinatorial Optimization, pages 475-486, 2002. Google Scholar
  20. Vera Traub and Rico Zenklusen. Local search for weighted tree augmentation and steiner tree. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA '22), pages 3253-3272, 2022. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact