Document Open Access Logo

Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs

Authors Timothy M. Chan, Dimitrios Skrepetos

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2018.24.pdf
  • Filesize: 482 kB
  • 13 pages

Document Identifiers

Subject Classification

Keywords
  • shortest paths
  • distance oracles
  • unit-disk graphs
  • planar graphs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present the first near-linear-time (1 + epsilon)-approximation algorithm for the diameter of a weighted unit-disk graph of n vertices, running in O(n log^2 n) time, for any constant epsilon>0, improving the near-O(n^{3/2})-time algorithm of Gao and Zhang [STOC 2003]. Using similar ideas, we can construct a (1+epsilon)-approximate distance oracle for weighted unit-disk graphs with O(1) query time, with a similar improvement in the preprocessing time, from near O(n^{3/2}) to O(n log^3 n). We also obtain new results for a number of other related problems in the weighted unit-disk graph metric, such as the radius and bichromatic closest pair.
As a further application, we use our new distance oracle, along with additional ideas, to solve the (1 + epsilon)-approximate all-pairs bounded-leg shortest paths problem for a set of n planar points, with near O(n^{2.579}) preprocessing time, O(n^2 log n) space, and O(log{log n}) query time, improving thus the near-cubic preprocessing bound by Roditty and Segal [SODA 2007].

Cite As Get BibTex

Timothy M. Chan and Dimitrios Skrepetos. Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.SoCG.2018.24

Author Details

Timothy M. Chan
Dimitrios Skrepetos

References

  1. Srinivasa Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA), pages 514-528, 1996. Google Scholar
  2. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel Smid, and Norbert Zeh. Approximating geometric bottleneck shortest paths. Computational Geometry, 29(3):233-249, 2004. Google Scholar
  3. Costas Busch, Ryan LaFortune, and Srikanta Tirthapura. Improved sparse covers for graphs excluding a fixed minor. In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 61-70, 2007. Google Scholar
  4. Sergio Cabello. Many distances in planar graphs. Algorithmica, 62(1-2):361-381, 2012. URL: http://dx.doi.org/10.1007/s00453-010-9459-0.
  5. Sergio Cabello. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2143-2152, 2017. Google Scholar
  6. Sergio Cabello and Miha Jejčič. Shortest paths in intersection graphs of unit disks. Computational Geometry, 48(4):360-367, 2015. Google Scholar
  7. Paul B. Callahan and S. Rao Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42(1):67-90, 1995. URL: http://dx.doi.org/10.1145/200836.200853.
  8. Timothy M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. Journal of the ACM, 57(3):16:1-16:15, 2010. URL: http://dx.doi.org/10.1145/1706591.1706596.
  9. Timothy M. Chan and Dimitrios Skrepetos. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In Proceedings of the 27th Annual International Symposium on Algorithms and Computation (ISAAC), pages 24:1-24:13, 2016. Google Scholar
  10. Timothy M. Chan and Dimitrios Skrepetos. Faster approximate diameter and distance oracles in planar graphs. In Proceedings of the 25th European Symposium on Algorithms (ESA), pages 25:1-25:13, 2017. Google Scholar
  11. Vincent Cohen-Addad, Søren Dahlgaard, and Christian Wulff-Nilsen. Fast and compact exact distance oracle for planar graphs. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 962-973, 2017. URL: http://dx.doi.org/10.1109/FOCS.2017.93.
  12. David Eppstein, Gary L. Miller, and Shang-Hua Teng. A deterministic linear time algorithm for geometric separators and its applications. Fundamenta Informaticae, 22(4):309-329, 1995. Google Scholar
  13. Jie Gao and Li Zhang. Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM Journal on Computing, 35(1):151-169, 2005. Preliminary version in STOC 2003. Google Scholar
  14. Pawel Gawrychowski, Shay Mozes, Oren Weimann, and Christian Wulff-Nilsen. Better tradeoffs for exact distance oracles in planar graphs. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 515-529, 2018. Google Scholar
  15. Pawel‚ Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, and Oren Weimann. Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n^5/3) time. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 495-514, 2018. Google Scholar
  16. Qian-Ping Gu and Gengchun Xu. Constant query time (1+ε)-approximate distance oracle for planar graphs. In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC), pages 625-636, 2015. Google Scholar
  17. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir. Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2495-2504, 2017. Google Scholar
  18. Ken-ichi Kawarabayashi, Christian Sommer, and Mikkel Thorup. More compact oracles for approximate distances in undirected planar graphs. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 550-563, 2013. Google Scholar
  19. Philip Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 820-827, 2002. Google Scholar
  20. François Le Gall. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 296-303, 2014. URL: http://dx.doi.org/10.1145/2608628.2608664.
  21. Xiang-Yang Li, Gruia Calinescu, and Peng-Jun Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 3, pages 1268-1277, 2002. Google Scholar
  22. Gary L Miller, S-H Teng, and Stephen A Vavasis. A unified geometric approach to graph separators. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 538-547, 1991. Google Scholar
  23. Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. Google Scholar
  24. Liam Roditty and Michael Segal. On bounded leg shortest paths problems. Algorithmica, 59(4):583-600, 2011. Preliminary version in SODA 2007. Google Scholar
  25. Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993-1024, 2004. Google Scholar
  26. Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), pages 887-898, 2012. URL: http://dx.doi.org/10.1145/2213977.2214056.
  27. Oren Weimann and Raphael Yuster. Approximating the diameter of planar graphs in near linear time. ACM Transactions on Algorithms, 12(1):1-13, 2016. Google Scholar
  28. Chenyu Yan, Yang Xiang, and Feodor F. Dragan. Compact and low delay routing labeling scheme for unit disk graphs. Computational Geometry, 45(7):305-325, 2012. URL: http://dx.doi.org/10.1016/j.comgeo.2012.01.015.
  29. Uri Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49(3):289-317, 2002. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact