Corpus ID: 208527713

PTAS for Steiner Tree on Map Graphs

@article{Byrka2019PTASFS,
  title={PTAS for Steiner Tree on Map Graphs},
  author={Jaroslaw Byrka and Mateusz Lewandowski and Syed Mohammad Meesum and Joachim Spoerhase and Sumedha Uniyal},
  journal={ArXiv},
  year={2019},
  volume={abs/1912.00717}
}
  • Jaroslaw Byrka, Mateusz Lewandowski, +2 authors Sumedha Uniyal
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map graphs, which builds on the result for planar edge weighted instances of Borradaile et al. The Steiner tree problem on map graphs can be casted as a special case of the planar node-weighted Steiner tree problem, for which only a 2.4-approximation is known. We prove and use a contraction decomposition theorem for planar… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

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

    Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics

    VIEW 1 EXCERPT

    Simple PTAS's for families of graphs excluding a minor

    VIEW 1 EXCERPT