On the hardness of approximating N P witnesses

Uriel Feige, Michael Langberg, Kobbi Nissim

Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings — 2000

DOI Link

BibTeX

@inproceedings{DBLP:conf/approx/FeigeLN00,
  author = {Feige, Uriel and Langberg, Michael and Nissim, Kobbi},
  editor = {Jansen, Klaus and Khuller, Samir},
  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},
  series = {Lecture Notes in Computer Science},
  volume = {1913},
  pages = {120--131},
  publisher = {Springer},
  year = {2000},
  url = {https://doi.org/10.1007/3-540-44436-X\_13},
  doi = {10.1007/3-540-44436-X\_13},
  timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl = {https://dblp.org/rec/conf/approx/FeigeLN00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}