Go to the corresponding LIPIcs Volume Portal 
Huang, ChienChung ; Mari, Mathieu ; Mathieu, Claire ; Mitchell, Joseph S. B. ; Mustafa, Nabil H.
pdfformat: 

@InProceedings{huang_et_al:LIPIcs:2019:11247, author = {ChienChung Huang and Mathieu Mari and Claire Mathieu and Joseph S. B. Mitchell and Nabil H. Mustafa}, title = {{Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {32:132:21}, 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/11247}, URN = {urn:nbn:de:0030drops112471}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.32}, annote = {Keywords: approximation algorithm, submodular function optimisation, unit disk graph, connectivity constraint} }
Keywords:  approximation algorithm, submodular function optimisation, unit disk graph, connectivity constraint  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  17.09.2019 