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 条
  • [41] An Improved Approximation Algorithm for the Terminal Steiner Tree Problem
    Chen, Yen Hung
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT III, 2011, 6784 : 141 - 151
  • [42] On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
    Althaus, Ernst
    Kupilas, Joschka
    Naujoks, Rouven
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 308 - 319
  • [43] On the low-dimensional Steiner minimum tree problem in Hamming metric
    Althaus, Ernst
    Kupilas, Joschka
    Naujoks, Rouven
    THEORETICAL COMPUTER SCIENCE, 2013, 505 : 2 - 10
  • [44] Improved distributed approximation for Steiner tree in the CONGEST model
    Saikia, Parikshit
    Karmakar, Sushanta
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 158 : 196 - 212
  • [45] MORE DYNAMIC DATA STRUCTURES FOR GEOMETRIC SET COVER WITH SUBLINEAR UPDATE TIME
    Chan, Timothy M.
    He, Qizheng
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2022, 13 (02) : 90 - 114
  • [46] Rectilinear Steiner tree construction using answer set programming
    Erdem, E
    Wong, MDF
    LOGIC PROGRAMMING, PROCEEDINGS, 2004, 3132 : 386 - 399
  • [47] Improved Upper Bounds for Partial Vertex Cover
    Kneis, Joachim
    Langer, Alexander
    Rossmanith, Peter
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 240 - 251
  • [48] Upper bounds for Vertex Cover further improved
    Niedermeier, R
    Rossmanith, P
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 561 - 570
  • [49] Improved parameterized upper bounds for vertex cover
    Chen, Jianer
    Kanj, Iyad A.
    Xia, Ge
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 238 - 249
  • [50] Towards Tight Bounds for the Streaming Set Cover Problem
    Har-Peled, Sariel
    Indyk, Piotr
    Mahabadi, Sepideh
    Vakilian, Ali
    PODS'16: PROCEEDINGS OF THE 35TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2016, : 371 - 383
12345