@article{DBLP:journals/siamcomp/AwerbuchABV98,
  author    = {Baruch Awerbuch and
               Yossi Azar and
               Avrim Blum and
               Santosh Vempala},
  title     = {New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting
               Salesmen},
  journal   = {{SIAM} J. Comput.},
  volume    = {28},
  number    = {1},
  pages     = {254--262},
  year      = {1998},
  url       = {https://doi.org/10.1137/S009753979528826X},
  doi       = {10.1137/S009753979528826X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/AwerbuchABV98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"FXRpzXdJ44N9aJXKp","bibbaseid":"awerbuch-azar-blum-vempala-newapproximationguaranteesforminimumweightktreesandprizecollectingsalesmen-1998","downloads":0,"creationDate":"2019-02-04T10:40:09.099Z","title":"New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen","author_short":["Awerbuch, B.","Azar, Y.","Blum, A.","Vempala, S."],"year":1998,"bibtype":"article","biburl":"https://dblp.org/pid/v/SantoshVempala.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Baruch"],"propositions":[],"lastnames":["Awerbuch"],"suffixes":[]},{"firstnames":["Yossi"],"propositions":[],"lastnames":["Azar"],"suffixes":[]},{"firstnames":["Avrim"],"propositions":[],"lastnames":["Blum"],"suffixes":[]},{"firstnames":["Santosh"],"propositions":[],"lastnames":["Vempala"],"suffixes":[]}],"title":"New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen","journal":"SIAM J. Comput.","volume":"28","number":"1","pages":"254–262","year":"1998","url":"https://doi.org/10.1137/S009753979528826X","doi":"10.1137/S009753979528826X","timestamp":"Sat, 27 May 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/siamcomp/AwerbuchABV98","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/siamcomp/AwerbuchABV98,\n author = {Baruch Awerbuch and\n Yossi Azar and\n Avrim Blum and\n Santosh Vempala},\n title = {New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting\n Salesmen},\n journal = {{SIAM} J. Comput.},\n volume = {28},\n number = {1},\n pages = {254--262},\n year = {1998},\n url = {https://doi.org/10.1137/S009753979528826X},\n doi = {10.1137/S009753979528826X},\n timestamp = {Sat, 27 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/siamcomp/AwerbuchABV98},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Awerbuch, B.","Azar, Y.","Blum, A.","Vempala, S."],"key":"DBLP:journals/siamcomp/AwerbuchABV98","id":"DBLP:journals/siamcomp/AwerbuchABV98","bibbaseid":"awerbuch-azar-blum-vempala-newapproximationguaranteesforminimumweightktreesandprizecollectingsalesmen-1998","role":"author","urls":{"Paper":"https://doi.org/10.1137/S009753979528826X"},"downloads":0},"search_terms":["new","approximation","guarantees","minimum","weight","trees","prize","collecting","salesmen","awerbuch","azar","blum","vempala"],"keywords":[],"authorIDs":[],"dataSources":["o5MdET8K3qoMZxPKp"]}