The Maximum Exposure Problem.
From MaRDI portal
Publication:5875471
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.19MaRDI QIDQ5875471
Neeraj Kumar, Stavros Sintos, Subhash Suri
Publication date: 3 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11234/pdf/LIPIcs-APPROX-RANDOM-2019-19.pdf/
Related Items
Cites Work
- Unnamed Item
- Optimal packing and covering in the plane are NP-complete
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- On the complexity of barrier resilience for fat regions and bounded ply
- Applications of random sampling in computational geometry. II
- Almost optimal set covers in finite VC-dimension
- Detecting high log-densities
- Approximation Algorithms for Union and Intersection Covering Problems
- On the set multicover problem in geometric settings
- A threshold of ln n for approximating set cover
- Approximation schemes for covering and packing problems in image processing and VLSI
- Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
- The Densest k-Subhypergraph Problem
- Greedily Finding a Dense Subgraph
- The dense \(k\)-subgraph problem