Go to the corresponding LIPIcs Volume Portal 
Kumar, Neeraj ; Sintos, Stavros ; Suri, Subhash
pdfformat: 

@InProceedings{kumar_et_al:LIPIcs:2019:11234, author = {Neeraj Kumar and Stavros Sintos and Subhash Suri}, title = {{The Maximum Exposure Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {19:119:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771252}, ISSN = {18688969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11234}, URN = {urn:nbn:de:0030drops112344}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.19}, annote = {Keywords: maxexposure, PTAS, densest ksubgraphs, geometric constraint removal, Network resilience} }
Keywords:  maxexposure, PTAS, densest ksubgraphs, geometric constraint removal, Network resilience  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  19.09.2019 