BibTeX record journals/jcss/AroraKK99

download as .bib file

@article{DBLP:journals/jcss/AroraKK99,
  author       = {Sanjeev Arora and
                  David R. Karger and
                  Marek Karpinski},
  title        = {Polynomial Time Approximation Schemes for Dense Instances of NP-Hard
                  Problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {58},
  number       = {1},
  pages        = {193--210},
  year         = {1999},
  url          = {https://doi.org/10.1006/jcss.1998.1605},
  doi          = {10.1006/JCSS.1998.1605},
  timestamp    = {Sun, 02 Oct 2022 15:40:57 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/AroraKK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.