A PTAS for the Steiner Forest Problem in Doubling Metrics

@article{Chan2016APF,
  title={A PTAS for the Steiner Forest Problem in Doubling Metrics},
  author={T.-H. Hubert Chan and Shuguang Hu and Shaofeng H.-C. Jiang},
  journal={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2016},
  pages={810-819}
}
  • T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang
  • Published in
    IEEE 57th Annual Symposium on…
    2016
  • Computer Science, Mathematics
  • We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the Steiner Forest Problem in doubling metrics. Before our work, a PTAS is given only for the Euclidean plane in [FOCS 2008: Borradaile, Klein and Mathieu]. Our PTAS also shares similarities with the dynamic programming for sparse instances used in [STOC 2012: Bartal, Gottlieb and Krauthgamer] and [SODA 2016: Chan and Jiang]. However, extending previous approaches requires overcoming several non-trivial hurdles, and we… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES

    A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    The Steiner tree problem on graphs: Inapproximability results

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Bypassing the embedding: algorithms for low dimensional metrics

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Greedy Algorithms for Steiner Forest

    VIEW 2 EXCERPTS

    A compendium on steiner tree problems

    • M. Karpiński
    • 2013

    A compendium on steiner tree problems

    • Mathias Hauptmann, Marek Karpiński
    • Inst. für Informatik,
    • 2013