Sublinear Metric Steiner Tree via Improved Bounds for Set Cover

被引：0
|
作者：
Mahabadi, Sepideh [2 ]
Roghani, Mohammad [1 ]
Tarnawski, Jakub [2 ]
Vakilian, Ali [3 ]
机构：
[1] Stanford University, United States
[2] Microsoft Research, United States
[3] Toyota Technological Institute at Chicago (TTIC), United States
来源：
arXiv |
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] The relation of Connected Set Cover and Group Steiner Tree
    Elbassioni, Khaled
    Jelic, Slobodan
    Matijevic, Domagoj
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 96 - 101
  • [2] Improved Error Bounds for Tree Representations of Metric Spaces
    Chowdhury, Samir
    Memoli, Facundo
    Smith, Zane
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
  • [3] Dynamic Set Cover: Improved Algorithms and Lower Bounds
    Abboud, Amir
    Addanki, Raghavendra
    Grandoni, Fabrizio
    Panigrahi, Debmalya
    Saha, Barna
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 114 - 125
  • [4] Improved upper bounds for the Steiner ratio
    Ismailescu, Dan
    Park, Joseph
    DISCRETE OPTIMIZATION, 2014, 11 : 22 - 30
  • [5] Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry
    Angelopoulos, Spyros
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 248 - 257
  • [6] Tighter bounds for graph Steiner tree approximation
    Robins, G
    Zelikovsky, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (01) : 122 - 134
  • [7] On the Steiner tree problem in lambda(3)-metric
    Li, YY
    Cheung, SK
    Leung, KS
    Wong, CK
    ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1564 - 1567
  • [8] Steiner tree constructions in λ3-metric
    Li, YY
    Cheung, SK
    Leung, KS
    Wong, CK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1998, 45 (05): : 563 - 574
  • [9] Query Complexity of the Metric Steiner Tree Problem
    Chen, Yu
    Khanna, Sanjeev
    Tan, Zihan
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 4893 - 4935
  • [10] On orientation metric and euclidean Steiner tree constructions
    Li, YY
    Leung, KS
    Wong, CK
    ISCAS '98 - PROCEEDINGS OF THE 1998 INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-6, 1998, : E241 - E243
12345