BibTeX record conf/approx/AshlagiACCGKMWW17

download as .bib file

@inproceedings{DBLP:conf/approx/AshlagiACCGKMWW17,
  author    = {Itai Ashlagi and
               Yossi Azar and
               Moses Charikar and
               Ashish Chiplunkar and
               Ofir Geri and
               Haim Kaplan and
               Rahul M. Makhijani and
               Yuyi Wang and
               Roger Wattenhofer},
  title     = {Min-Cost Bipartite Perfect Matching with Delays},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
               CA, {USA}},
  pages     = {1:1--1:20},
  year      = {2017},
  crossref  = {DBLP:conf/approx/2017},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2017.1},
  timestamp = {Thu, 23 Aug 2018 15:56:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/AshlagiACCGKMWW17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2017,
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Williamson and
               Santosh Srinivas Vempala},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
               CA, {USA}},
  series    = {LIPIcs},
  volume    = {81},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-044-6},
  isbn      = {978-3-95977-044-6},
  timestamp = {Mon, 14 Aug 2017 18:26:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier