The Maximum Exposure Problem. (Q5875471): Difference between revisions

@@ label / en / label / en @@
+The Maximum Exposure Problem.
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2019/11234/pdf/LIPIcs-APPROX-RANDOM-2019-19.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2977536504
@@ Property / OpenAlex ID: W2977536504 / rank @@
+Normal rank
@@ Property / title @@
+The Maximum Exposure Problem. (English)
@@ Property / title: The Maximum Exposure Problem. (English) / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009492
@@ Property / cites work: Q5009492 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+On the set multicover problem in geometric settings
+Normal rank
@@ Property / cites work @@
+The Densest k-Subhypergraph Problem
@@ Property / cites work: The Densest k-Subhypergraph Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Union and Intersection Covering Problems
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+On the complexity of barrier resilience for fat regions and bounded ply
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5875471