Document Open Access Logo

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications

Author Arnold Filtser

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.49.pdf
  • Filesize: 1.01 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Random projections and metric embeddings
  • Theory of computation → Computational geometry
  • Theory of computation → Graph algorithms analysis
Keywords
  • Sparse cover
  • minor free graphs
  • metric embeddings
  • 𝓁_∞
  • oblivious buy-at-bulk

Metrics

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

Abstract

Given a metric space (X,d_X), a (β,s,Δ)-sparse cover is a collection of clusters 𝒞 ⊆ P(X) with diameter at most Δ, such that for every point x ∈ X, the ball B_X(x,Δ/β) is fully contained in some cluster C ∈ 𝒞, and x belongs to at most s clusters in 𝒞. Our main contribution is to show that the shortest path metric of every K_r-minor free graphs admits (O(r),O(r²),Δ)-sparse cover, and for every ε > 0, (4+ε,O(1/ε)^r,Δ)-sparse cover (for arbitrary Δ > 0). We then use this sparse cover to show that every K_r-minor free graph embeds into 𝓁_∞^{Õ(1/ε)^{r+1}⋅log n} with distortion 3+ε (resp. into 𝓁_∞^{Õ(r²)⋅log n} with distortion O(r)). Further, among other applications, this sparse cover immediately implies an algorithm for the oblivious buy-at-bulk problem in fixed minor free graphs with the tight approximation factor O(log n) (previously nothing beyond general graphs was known).

Cite As Get BibTex

Arnold Filtser. On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and Other Applications. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 49:1-49:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.49

Author Details

Arnold Filtser
  • Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

Funding

This research was supported by the Israel Science Foundation (grant No. 1042/22).

References

  1. I. Abraham and C. Gavoille. Object location using path separators. In Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '06, pages 188-197, 2006. Full version: https://www.cse.huji.ac.il/~ittaia/papers/AG-TR.pdf. URL: https://doi.org/10.1145/1146381.1146411.
  2. I. Abraham, C. Gavoille, A. Gupta, O. Neiman, and K. Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC `14, pages 79-88, 2014. URL: https://doi.org/10.1145/2591796.2591849.
  3. I. Abraham, C. Gavoille, D. Malkhi, and U. Wieder. Strong-diameter decompositions of minor free graphs. Theory of Computing Systems, 47(4):837-855, 2010. URL: https://doi.org/10.1007/s00224-010-9283-6.
  4. Ittai Abraham, Yair Bartal, and Ofer Neiman. Advances in metric embedding theory. Advances in Mathematics, 228(6):3026-3126, 2011. URL: https://doi.org/10.1016/j.aim.2011.08.003.
  5. Ittai Abraham, Arnold Filtser, Anupam Gupta, and Ofer Neiman. Metric embedding via shortest path decompositions. SIAM J. Comput., 51(2):290-314, 2022. a priliminary version apperared in the proceedings of STOC 18. URL: https://doi.org/10.1137/19m1296021.
  6. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. SIAM J. Comput., 48(3):1120-1145, 2019. preliminary version published in STOC 2014. URL: https://doi.org/10.1137/17M1112406.
  7. Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. Compact routing for graphs excluding a fixed minor. In Pierre Fraigniaud, editor, Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings, volume 3724 of Lecture Notes in Computer Science, pages 442-456. Springer, 2005. URL: https://doi.org/10.1007/11561927_32.
  8. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, and Mikkel Thorup. Compact name-independent routing with minimum stretch. ACM Trans. Algorithms, 4(3):37:1-37:12, 2008. URL: https://doi.org/10.1145/1367064.1367077.
  9. Noga Alon, Richard M. Karp, David Peleg, and Douglas B. West. A graph-theoretic game and its application to the k-server problem. SIAM J. Comput., 24(1):78-100, 1995. preliminary version published in On-Line Algorithms 1991. URL: https://doi.org/10.1137/S0097539792224474.
  10. Thomas Andreae. On a pursuit game played on graphs for which a minor is excluded. J. Comb. Theory, Ser. B, 41(1):37-47, 1986. URL: https://doi.org/10.1016/0095-8956(86)90026-2.
  11. Hagit Attiya and Jennifer L. Welch. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley series on parallel and distributed computing. Wiley, 2004. Google Scholar
  12. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 514-522, 1990. Google Scholar
  13. Baruch Awerbuch, Shay Kutten, and David Peleg. On buffer-economical store-and-forward deadlock prevention. IEEE Trans. Commun., 42(11):2934-2937, 1994. URL: https://doi.org/10.1109/26.328973.
  14. Baruch Awerbuch and David Peleg. Sparse partitions. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS), pages 503-513, 1990. URL: https://doi.org/10.1109/FSCS.1990.89571.
  15. Baruch Awerbuch and David Peleg. Concurrent online tracking of mobile users. In Lyman Chapin, editor, Proceedings of the Conference on Communications Architecture & Protocols, SIGCOMM 1991, Zürich, Switzerland, September 3-6, 1991, pages 221-233. ACM, 1991. URL: https://doi.org/10.1145/115992.116013.
  16. Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pages 184-193, 1996. URL: https://doi.org/10.1109/SFCS.1996.548477.
  17. Yair Bartal, Nova Fandina, and Ofer Neiman. Covering metric spaces by few trees. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, pages 20:1-20:16, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.20.
  18. Yair Bartal, Arnold Filtser, and Ofer Neiman. On notions of distortion and an almost minimum spanning tree with constant average distortion. J. Comput. Syst. Sci., 105:116-129, 2019. preliminary version published in SODA 2016. URL: https://doi.org/10.1016/j.jcss.2019.04.006.
  19. Yair Bartal and Lee-Ad Gottlieb. Approximate nearest neighbor search for 𝓁_p-spaces (2 < p < ∞). Theor. Comput. Sci., 757:27-35, 2019. URL: https://doi.org/10.1016/J.TCS.2018.07.011.
  20. Sujoy Bhore, Arnold Filtser, and Csaba D. Toth. Online duet between metric embeddings and minimum-weight perfect matchings. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4564-4579, 2024. URL: https://doi.org/10.1137/1.9781611977912.162.
  21. J. Bourgain. On lipschitz embedding of finite metric spaces in hilbert space. Israel Journal of Mathematics, 52(1-2):46-52, 1985. URL: https://doi.org/10.1007/BF02776078.
  22. Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, and Srinivasagopalan Srivathsan. Split and join: Strong partitions and universal steiner trees for graphs. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 81-90. IEEE Computer Society, 2012. URL: https://doi.org/10.1109/FOCS.2012.45.
  23. Costas Busch, Ryan LaFortune, and Srikanta Tirthapura. Sparse covers for planar graphs and graphs that exclude a fixed minor. Algorithmica, 69(3):658-684, 2014. URL: https://doi.org/10.1007/S00453-013-9757-4.
  24. Ostas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D Ellis Hershkowitz, and Rajmohan Rajaraman. One tree to rule them all: Poly-logarithmic universal steiner tree. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 60-76, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00012.
  25. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, and Cuong Than. Covering planar metrics (and beyond): O(1) trees suffice. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2231-2261, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00139.
  26. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, and Cuong Than. Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 5300-5331, 2024. URL: https://doi.org/10.1137/1.9781611977912.191.
  27. Yun Kuen Cheung. Steiner point removal - distant terminals don't (really) bother. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1353-1360. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.89.
  28. Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, and Hung Le. On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs. CoRR, abs/2009.05039, 2020. To appear in FOCS 2020, URL: https://arxiv.org/abs/2009.05039.
  29. Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, and Michał Pilipczuk. Planar and minor-free metrics embed into metrics of polylogarithmic treewidth with expected multiplicative distortion arbitrarily close to 1*. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2262-2277, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00140.
  30. M. Elkin, A. Filtser, and O. Neiman. Terminal embeddings. Theoretical Computer Science, 697:1-36, 2017. URL: https://doi.org/10.1016/j.tcs.2017.06.021.
  31. Michael Elkin, Arnold Filtser, and Ofer Neiman. Prioritized metric structures and embedding. SIAM J. Comput., 47(3):829-858, 2018. URL: https://doi.org/10.1137/17M1118749.
  32. Michael Elkin and Ofer Neiman. Lossless prioritized embeddings. SIAM J. Discret. Math., 36(3):1529-1550, 2022. URL: https://doi.org/10.1137/21M1436221.
  33. Michael Elkin, Ofer Neiman, and Christian Wulff-Nilsen. Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci., 651:1-10, 2016. URL: https://doi.org/10.1016/j.tcs.2016.07.038.
  34. P. Erdős. Extremal problems in graph theory. In in “Theory of Graphs and Its Applications,” Proc. Sympos. Smolenice, pages 29-36, 1964. Google Scholar
  35. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485-497, November 2004. preliminary version published in STOC 2003. URL: https://doi.org/10.1016/j.jcss.2004.04.011.
  36. Jittat Fakcharoenphol and Kunal Talwar. An improved decomposition theorem for graphs excluding a fixed minor. In RANDOM-APPROX, pages 36-46, 2003. URL: https://doi.org/10.1007/978-3-540-45198-3_4.
  37. Martin Farach-Colton and Piotr Indyk. Approximate nearest neighbor algorithms for hausdorff metrics via embeddings. In 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pages 171-180. IEEE Computer Society, 1999. URL: https://doi.org/10.1109/SFFCS.1999.814589.
  38. Arnold Filtser. On strong diameter padded decompositions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, pages 6:1-6:21, 2019. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.6.
  39. Arnold Filtser. Steiner point removal with distortion O(log k) using the relaxed-voronoi algorithm. SIAM J. Comput., 48(2):249-278, 2019. URL: https://doi.org/10.1137/18M1184400.
  40. Arnold Filtser. A face cover perspective to 𝓁₁ embeddings of planar graphs. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1945-1954. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.120.
  41. Arnold Filtser. Scattering and sparse partitions, and their applications. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168 of LIPIcs, pages 47:1-47:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.47.
  42. Arnold Filtser. Labeled nearest neighbor search and metric spanners via locality sensitive orderings. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, volume 258 of LIPIcs, pages 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.SoCG.2023.33.
  43. Arnold Filtser. On sparse covers of minor free graphs, low dimensional metric embeddings, and other applications. CoRR, abs/2401.14060, 2024. URL: https://doi.org/10.48550/arXiv.2401.14060.
  44. Arnold Filtser, Yuval Gitlitz, and Ofer Neiman. Light, reliable spanners. CoRR, abs/2307.16612, 2023. URL: https://doi.org/10.48550/arXiv.2307.16612.
  45. Arnold Filtser, Lee-Ad Gottlieb, and Robert Krauthgamer. Labelings vs. embeddings: On distributed and prioritized representations of distances. Discret. Comput. Geom., 2023. URL: https://doi.org/10.1007/s00454-023-00565-2.
  46. Arnold Filtser, Robert Krauthgamer, and Ohad Trabelsi. Relaxed voronoi: A simple framework for terminal-clustering problems. In Jeremy T. Fineman and Michael Mitzenmacher, editors, 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, volume 69 of OASIcs, pages 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/OASICS.SOSA.2019.10.
  47. Arnold Filtser and Hung Le. Clan embeddings into trees, and low treewidth graphs. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 342-355. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451043.
  48. Arnold Filtser and Hung Le. Locality-sensitive orderings and applications to reliable spanners. In Stefano Leonardi and Anupam Gupta, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 1066-1079. ACM, 2022. URL: https://doi.org/10.1145/3519935.3520042.
  49. Arnold Filtser and Hung Le. Low treewidth embeddings of planar and minor-free metrics. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 1081-1092. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00105.
  50. Arnold Filtser and Ofer Neiman. Light spanners for high dimensional norms via stochastic decompositions. Algorithmica, 2022. URL: https://doi.org/10.1007/s00453-022-00994-0.
  51. E. Fox-Epstein, P. N. Klein, and A. Schild. Embedding planar graphs into low-treewidth graphs with applications to efficient approximation schemes for metric problems. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA `19, pages 1069-1088, 2019. URL: https://doi.org/10.1137/1.9781611975482.66.
  52. Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, and Konstantinos S. Stavropoulos. Coloring and covering nowhere dense graphs. SIAM J. Discret. Math., 32(4):2467-2481, 2018. URL: https://doi.org/10.1137/18M1168753.
  53. Anupam Gupta, Mohammad Taghi Hajiaghayi, and Harald Räcke. Oblivious network design. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 970-979. ACM Press, 2006. URL: http://dl.acm.org/citation.cfm?id=1109557.1109665.
  54. Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair. Cuts, trees and l_1-embeddings of graphs. Comb., 24(2):233-269, 2004. URL: https://doi.org/10.1007/S00493-004-0015-X.
  55. Sariel Har-Peled, Piotr Indyk, and Anastasios Sidiropoulos. Euclidean spanners in high dimensions. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 804-809, 2013. URL: https://doi.org/10.1137/1.9781611973105.57.
  56. Sariel Har-Peled, Manor Mendel, and Dániel Oláh. Reliable spanners for metric spaces. ACM Trans. Algorithms, 19(1):7:1-7:27, 2023. URL: https://doi.org/10.1145/3563356.
  57. Makoto Imase and Bernard M. Waxman. Dynamic steiner tree problem. SIAM J. Discret. Math., 4(3):369-384, 1991. URL: https://doi.org/10.1137/0404033.
  58. Piotr Indyk. On approximate nearest neighbors in non-euclidean spaces. In 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pages 148-155. IEEE Computer Society, 1998. URL: https://doi.org/10.1109/SFCS.1998.743438.
  59. Piotr Indyk. Approximate nearest neighbor algorithms for Fréchet distance via product metrics. In Proceedings of the 8th Symposium on Computational Geometry, pages 102-106, Barcelona, Spain, June 2002. ACM Press. URL: https://doi.org/10.1145/513400.513414.
  60. Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, and Anastasios Zouzias. Online embeddings. In Maria J. Serna, Ronen Shaltiel, Klaus Jansen, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings, volume 6302 of Lecture Notes in Computer Science, pages 246-259. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15369-3_19.
  61. Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, and Ravi Sundaram. Universal approximations for tsp, steiner tree, and set cover. In Harold N. Gabow and Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pages 386-395. ACM, 2005. URL: https://doi.org/10.1145/1060590.1060649.
  62. D. S. Johnson. The NP-completeness column: An ongoing guide (column 19). Journal of Algorithms, 8(3):438-448, 1987. Google Scholar
  63. William Johnson and Joram Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984. see URL: https://link.springer.com/article/10.1007/BF02764938.
  64. Lior Kamma, Robert Krauthgamer, and Huy L. Nguyen. Cutting corners cheaply, or how to remove steiner points. SIAM J. Comput., 44(4):975-995, 2015. URL: https://doi.org/10.1137/140951382.
  65. Philip Klein, Serge A. Plotkin, and Satish Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, STOC '93, pages 682-690, New York, NY, USA, 1993. ACM. URL: https://doi.org/10.1145/167088.167261.
  66. Philip N. Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA, pages 820-827, 2002. see https://dl.acm.org/doi/abs/10.5555/545381.545488. URL: http://dl.acm.org/citation.cfm?id=545381.545488.
  67. Robert Krauthgamer, James R. Lee, Manor Mendel, and Assaf Naor. Measured descent: a new embedding method for finite metrics. Geometric and Functional Analysis, 15(4):839-858, 2005. preliminary version published in FOCS 2004. URL: https://doi.org/10.1007/s00039-005-0527-6.
  68. Robert Krauthgamer, James R. Lee, and Havana Rika. Flow-cut gaps and face covers in planar graphs. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 525-534. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.33.
  69. Nikhil Kumar. An approximate generalization of the okamura-seymour theorem. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 1093-1101. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00106.
  70. Hung Le and Shay Solomon. A unified framework for light spanners. In Barna Saha and Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 295-308. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585185.
  71. James R. Lee and Prasad Raghavendra. Coarse differentiation and multi-flows in planar graphs. Discret. Comput. Geom., 43(2):346-362, 2010. URL: https://doi.org/10.1007/S00454-009-9172-4.
  72. Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Comb., 15(2):215-245, 1995. preliminary version published in FOCS 1994. URL: https://doi.org/10.1007/BF01200757.
  73. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996. Google Scholar
  74. Jiří Matoušek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93(1):333-344, 1996. URL: https://doi.org/10.1007/BF02761110.
  75. Ofer Neiman. Low dimensional embeddings of doubling metrics. Theory Comput. Syst., 58(1):133-152, 2016. URL: https://doi.org/10.1007/S00224-014-9567-3.
  76. Ilan Newman and Yuri Rabinovich. A lower bound on the distortion of embedding planar metrics into euclidean space. In SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry, pages 94-96. ACM Press, 2002. URL: https://doi.org/10.1145/513400.513412.
  77. Ilan Newman and Yuri Rabinovich. Online embedding of metrics. In Susanne Albers, editor, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands, volume 162 of LIPIcs, pages 32:1-32:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.SWAT.2020.32.
  78. Haruko Okamura and P.D. Seymour. Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B, 31(1):75-81, 1981. URL: https://doi.org/10.1016/S0095-8956(81)80012-3.
  79. David Peleg. Distance-dependent distributed directories. Inf. Comput., 103(2):270-298, 1993. URL: https://doi.org/10.1006/INCO.1993.1020.
  80. David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA, 2000. URL: https://doi.org/10.1137/1.9780898719772.
  81. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. J. ACM, 36(3):510-530, 1989. URL: https://doi.org/10.1145/65950.65953.
  82. Satish Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999, pages 300-306, 1999. URL: https://doi.org/10.1145/304893.304983.
  83. N. Robertson and P. D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatoral Theory Series B, 89(1):43-76, 2003. URL: https://doi.org/10.1016/S0095-8956(03)00042-X.
  84. Srinivasagopalan Srivathsan, Costas Busch, and S. Sitharama Iyengar. Oblivious buy-at-bulk in planar graphs. In Naoki Katoh and Amit Kumar, editors, WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, volume 6552 of Lecture Notes in Computer Science, pages 33-44. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-19094-0_6.
  85. Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. J. ACM, 51(6):993-1024, November 2004. URL: https://doi.org/10.1145/1039488.1039493.
  86. Mikkel Thorup and Uri Zwick. Compact routing schemes. In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pages 1-10, 2001. URL: https://doi.org/10.1145/378580.378581.
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