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
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 1 条
  • [1] Improved (In-)Approximability Bounds for d-Scattered Set
    Katsikarelis I.
    Lampis M.
    Paschos V.Th.
    Journal of Graph Algorithms and Applications, 2023, 27 (03) : 219 - 238