BibTeX record conf/approx/CheriyanFG12

download as .bib file

@inproceedings{DBLP:conf/approx/CheriyanFG12,
  author    = {Joseph Cheriyan and
               Zachary Friggstad and
               Zhihan Gao},
  title     = {Approximating Minimum-Cost Connected T-Joins},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  pages     = {110--121},
  year      = {2012},
  crossref  = {DBLP:conf/approx/2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0\_10},
  doi       = {10.1007/978-3-642-32512-0\_10},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/CheriyanFG12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
  editor    = {Anupam Gupta and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Rocco A. Servedio},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7408},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0},
  doi       = {10.1007/978-3-642-32512-0},
  isbn      = {978-3-642-32511-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics