Document Open Access Logo

Approximating Densest Subgraph in Geometric Intersection Graphs

Authors Sariel Har-Peled , Saladi Rahul

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.STACS.2025.43.pdf
  • Filesize: 0.87 MB
  • 17 pages
HTML5 Logo HTML (experimental)
LIPIcs.STACS.2025.43.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation β†’ Computational geometry
Keywords
  • Geometric intersection graphs
  • Densest subgraph
  • Range searching
  • Approximation algorithms

Metrics

Abstract

For an undirected graph 𝖦 = (𝖡, 𝖀), with n vertices and m edges, the densest subgraph problem, is to compute a subset S βŠ† 𝖡 which maximizes the ratio |𝖀_S|/|S|, where 𝖀_S βŠ† 𝖀 is the set of all edges of 𝖦 with endpoints in S. The densest subgraph problem is a well studied problem in computer science. Existing exact and approximation algorithms for computing the densest subgraph require Ξ©(m) time. We present near-linear time (in n) approximation algorithms for the densest subgraph problem on implicit geometric intersection graphs, where the vertices are explicitly given but not the edges. As a concrete example, we consider n disks in the plane with arbitrary radii and present two different approximation algorithms.
As a by-product, we show a reduction from (shallow) range-reporting to approximate counting/sampling which seems to be new and is useful for other problems such as independent query sampling.

Cite As Get BibTex

Sariel Har-Peled and Saladi Rahul. Approximating Densest Subgraph in Geometric Intersection Graphs. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 43:1-43:17, Schloss Dagstuhl – Leibniz-Zentrum fΓΌr Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.43

Author Details

Sariel Har-Peled
  • Department of Computer Science, University of Illinois at Urbana-Champaign, IL, USA
Saladi Rahul
  • Indian Institute of Science (IISc), Bangalore, India

Funding

Research of Saladi Rahul is funded by Walmart Center for Tech Excellence.

References

  1. Peyman Afshani and Timothy M. Chan. Optimal halfspace range reporting in three dimensions. In Claire Mathieu, editor, Proc. 20th ACM-SIAM Sympos. Discrete Algs. (SODA), pages 180-186. SIAM, 2009. URL: https://doi.org/10.1137/1.9781611973068.21.
  2. Peyman Afshani, Chris H. Hamilton, and Norbert Zeh. A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom., 43(8):700-712, 2010. URL: https://doi.org/10.1016/J.COMGEO.2010.04.003.
  3. Peyman Afshani and Jeff M. Phillips. Independent range sampling, revisited again. In Proceedings of Symposium on Computational Geometry (SoCG), volume 129, pages 4:1-4:13, 2019. URL: https://doi.org/10.4230/LIPICS.SOCG.2019.4.
  4. Pankaj K. Agarwal and Jiangwei Pan. Near-linear algorithms for geometric hitting sets and set covers. In Proceedings of Symposium on Computational Geometry (SoCG), page 271, 2014. URL: https://doi.org/10.1145/2582112.2582152.
  5. Boris Aronov and Sariel Har-Peled. On approximating the depth and related problems. SIAM Journal of Computing, 38(3):899-921, 2008. URL: https://doi.org/10.1137/060669474.
  6. Bahman Bahmani, Ashish Goel, and Kamesh Munagala. Efficient primal-dual graph algorithms for mapreduce. In Algorithms and Models for the Web Graph: 11th International Workshop, pages 59-78, 2014. URL: https://doi.org/10.1007/978-3-319-13123-8_6.
  7. Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii. Densest subgraph in streaming and mapreduce. Proceedings of the VLDB Endowment, 5(5):454-465, 2012. URL: https://doi.org/10.14778/2140436.2140442.
  8. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 173-182, 2015. URL: https://doi.org/10.1145/2746539.2746592.
  9. Sergio Cabello, Jean Cardinal, and Stefan Langerman. The clique problem in ray intersection graphs. Discrete & Computational Geometry, 50(3):771-783, 2013. URL: https://doi.org/10.1007/S00454-013-9538-5.
  10. Moses Charikar. Greedy approximation algorithms for finding dense components in a graph. In Proceedings of Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 84-95, 2000. URL: https://doi.org/10.1007/3-540-44436-X_10.
  11. Chandra Chekuri, Sariel Har-Peled, and Kent Quanrud. Fast LP-based approximations for geometric packing and covering problems. In Proc. 31st ACM-SIAM Sympos. Discrete Algs. (SODA), pages 1019-1038, 2020. URL: https://doi.org/10.1137/1.9781611975994.62.
  12. Jie Chen and Yousef Saad. Dense subgraph extraction with application to community detection. IEEE Transactions on Knowledge and Data Engineering (TKDE), 24(7):1216-1230, 2012. URL: https://doi.org/10.1109/TKDE.2010.271.
  13. Brent N. Clark, Charles J. Colbourn, and David S. Johnson. Unit disk graphs. Discrete Mathematics, 86(1-3):165-177, 1990. URL: https://doi.org/10.1016/0012-365X(90)90358-O.
  14. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal of Computing, 32(5):1338-1355, 2003. URL: https://doi.org/10.1137/S0097539702403098.
  15. Alessandro Epasto, Silvio Lattanzi, and Mauro Sozio. Efficient densest subgraph computation in evolving graphs. In Proceedings of International World Wide Web Conferences (WWW), pages 300-310, 2015. URL: https://doi.org/10.1145/2736277.2741638.
  16. Hossein Esfandiari, MohammadTaghi Hajiaghayi, and David P. Woodruff. Brief announcement: Applications of uniform sampling: Densest subgraph and beyond. In Proceedings of Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 397-399, 2016. URL: https://doi.org/10.1145/2935764.2935813.
  17. Giorgio Gallo, Michael D. Grigoriadis, and Robert Endre Tarjan. A fast parametric maximum flow algorithm and applications. SIAM Journal of Computing, 18(1):30-55, 1989. URL: https://doi.org/10.1137/0218003.
  18. David Gibson, Ravi Kumar, and Andrew Tomkins. Discovering large dense subgraphs in massive graphs. In Proceedings of Very Large Data Bases (VLDB), pages 721-732, 2005. URL: http://www.vldb.org/archives/website/2005/program/paper/thu/p721-gibson.pdf.
  19. A. V. Goldberg. Finding a maximum density subgraph. Technical report, University of California at Berkeley, Berkeley, CA, USA, 1984. Google Scholar
  20. Sariel Har-Peled. Geometric Approximation Algorithms, volume 173 of Math. Surveys & Monographs. Amer. Math. Soc., Boston, MA, USA, 2011. URL: https://doi.org/10.1090/surv/173.
  21. Samir Khuller and Barna Saha. On finding dense subgraphs. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 597-608, 2009. URL: https://doi.org/10.1007/978-3-642-02927-1_50.
  22. Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, and Francesco Bonchi. A survey on the densest subgraph problem and its variants. CoRR, abs/2303.14467, 2023. URL: https://doi.org/10.48550/arXiv.2303.14467.
  23. Chih-Hung Liu. Nearly optimal planar k nearest neighbors queries under general distance functions. SIAM J. Comput., 51(3):723-765, 2022. URL: https://doi.org/10.1137/20M1388371.
  24. Andrew McGregor, David Tench, Sofya Vorotnikova, and Hoa T. Vu. Densest subgraph in dynamic graph streams. In Proceedings of Mathematical Foundations of Computer Science (MFCS), pages 472-482, 2015. URL: https://doi.org/10.1007/978-3-662-48054-0_39.
  25. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 1995. URL: https://doi.org/10.1017/CBO9780511814075.
  26. Saurabh Sawlani and Junxing Wang. Near-optimal fully dynamic densest subgraph. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 181-193, 2020. URL: https://doi.org/10.1145/3357713.3384327.
  27. Yufei Tao. Algorithmic techniques for independent query sampling. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 129-138, 2022. URL: https://doi.org/10.1145/3517804.3526068.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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