BibTeX record: conf/approx/FeigeLN00

download as .bib file

@inproceedings{DBLP:conf/approx/FeigeLN00,
  author    = {Uriel Feige and
               Michael Langberg and
               Kobbi Nissim},
  title     = {On the hardness of approximating \emph{N P} witnesses},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
               Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
               5-8, 2000, Proceedings},
  year      = {2000},
  pages     = {120--131},
  crossref  = {DBLP:conf/approx/2000},
  url       = {http://dx.doi.org/10.1007/3-540-44436-X_13},
  doi       = {10.1007/3-540-44436-X_13},
  timestamp = {Fri, 24 Oct 2014 17:50:03 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeigeLN00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2000,
  editor    = {Klaus Jansen and
               Samir Khuller},
  title     = {Approximation Algorithms for Combinatorial Optimization, Third International
               Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
               5-8, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  year      = {2000},
  volume    = {1913},
  publisher = {Springer},
  isbn      = {3-540-67996-0},
  timestamp = {Fri, 24 Oct 2014 17:50:03 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}