BibTeX record conf/approx/HuangMMMM19

download as .bib file

@inproceedings{DBLP:conf/approx/HuangMMMM19,
  author    = {Chien{-}Chung 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, September 20-22, 2019, Massachusetts
               Institute of Technology, Cambridge, MA, {USA}},
  pages     = {32:1--32:21},
  year      = {2019},
  crossref  = {DBLP:conf/approx/2019},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.32},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2019.32},
  timestamp = {Tue, 17 Sep 2019 17:11:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/HuangMMMM19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2019,
  editor    = {Dimitris Achlioptas and
               L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
               Institute of Technology, Cambridge, MA, {USA}},
  series    = {LIPIcs},
  volume    = {145},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-125-2},
  isbn      = {978-3-95977-125-2},
  timestamp = {Tue, 17 Sep 2019 14:58:05 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics