BibTeX record conf/isaac/JansenS02

download as .bib file

@inproceedings{DBLP:conf/isaac/JansenS02,
  author       = {Klaus Jansen and
                  Roberto Solis{-}Oba},
  editor       = {Prosenjit Bose and
                  Pat Morin},
  title        = {An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering},
  booktitle    = {Algorithms and Computation, 13th International Symposium, {ISAAC}
                  2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2518},
  pages        = {175--186},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36136-7\_16},
  doi          = {10.1007/3-540-36136-7\_16},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/JansenS02.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.