The maximum exposure problem

Chlamtáč, 2017, Minimizing the union: tight approximations for small set bipartite vertex expansion, 881 Feige, 1998, A threshold of ln n for approximating set cover, J. ACM, 45, 634, 10.1145/285055.285059 Fowler, 1981, Optimal packing and covering in the plane are NP-complete, Inf. Process. Lett., 12, 133, 10.1016/0020-0190(81)90111-3 Chlamtác, 2018, The densest k-subhypergraph problem, SIAM J. Discrete Math., 32, 1458, 10.1137/16M1096402 Feige, 2001, The dense k-subgraph problem, Algorithmica, 29, 410, 10.1007/s004530010050 Asahiro, 2000, Greedily finding a dense subgraph, J. Algorithms, 34, 203, 10.1006/jagm.1999.1062 Arora, 1999, Polynomial time approximation schemes for dense instances of NP-hard problems, J. Comput. Syst. Sci., 58, 193, 10.1006/jcss.1998.1605 Bhaskara, 2010, Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph, 201 Agarwal, 2014, Near-linear algorithms for geometric hitting sets and set covers, 271 Brönnimann, 1995, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom., 14, 463, 10.1007/BF02570718 Mustafa, 2014, Settling the APX-hardness status for geometric set cover, 541 Chekuri, 2012, On the set multi-cover problem in geometric settings, ACM Trans. Algorithms, 9, 9, 10.1145/2390176.2390185 Cygan, 2011, Approximation algorithms for union and intersection covering problems, 28 Bandyapadhyay, 2018, Improved approximation bounds for the minimum constraint removal problem, 2:1 Eiben, 2018, Improved results for minimum constraint removal Bereg, 2009, Approximating barrier resilience in wireless sensor networks, 29 Korman, 2018, On the complexity of barrier resilience for fat regions and bounded ply, Comput. Geom., 72, 34, 10.1016/j.comgeo.2018.02.006 Feige, 1997 Clarkson, 1989, Application of random sampling in computational geometry, II, Discrete Comput. Geom., 4, 387, 10.1007/BF02187740 Hochbaum, 1985, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM, 32, 130, 10.1145/2455.214106 Kumar, 2019, The maximum exposure problem, 19:1