Approximating densest subgraph in geometric intersection graphs

DOI10.4230/LIPICS.STACS.2025.43MaRDI QIDQ7287780zbMATH OpenFDO

Authors Sariel Har-Peled, Saladi Rahul

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.43

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• A general approach for cache-oblivious range reporting and approximate range counting
• Densest subgraph in dynamic graph streams
• Efficient primal-dual graph algorithms for MapReduce
• Fast LP-based Approximations for Geometric Packing and Covering Problems
• Geometric approximation algorithms
• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 7559204 (Why is no real title available?)
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
• Near-optimal fully dynamic densest subgraph
• Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
• On Approximating the Depth and Related Problems
• On Finding Dense Subgraphs
• Optimal halfspace range reporting in three dimensions
• Reachability and Distance Queries via 2-Hop Labels
• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
• The clique problem in ray intersection graphs
• Unit disk graphs

This page was built for publication: Approximating densest subgraph in geometric intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287780)