BibTeX record conf/stoc/AgarwalCMM05

download as .bib file

@inproceedings{DBLP:conf/stoc/AgarwalCMM05,
  author    = {Amit Agarwal and
               Moses Charikar and
               Konstantin Makarychev and
               Yury Makarychev},
  title     = {O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion,
               and directed cut problems},
  booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  pages     = {573--581},
  year      = {2005},
  crossref  = {DBLP:conf/stoc/2005},
  url       = {https://doi.org/10.1145/1060590.1060675},
  doi       = {10.1145/1060590.1060675},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/AgarwalCMM05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2005,
  editor    = {Harold N. Gabow and
               Ronald Fagin},
  title     = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  publisher = {{ACM}},
  year      = {2005},
  isbn      = {1-58113-960-8},
  timestamp = {Wed, 22 Sep 2021 16:03:25 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/2005.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics