@inproceedings{conf/esa/PolzinD02,
  added-at = {2017-05-26T00:00:00.000+0200},
  author = {Polzin, Tobias and Daneshmand, Siavash Vahdati},
  biburl = {https://www.bibsonomy.org/bibtex/232b2a0ce65492f420267e700780bb5a2/dblp},
  booktitle = {ESA},
  crossref = {conf/esa/2002},
  editor = {Möhring, Rolf H. and Raman, Rajeev},
  ee = {https://doi.org/10.1007/3-540-45749-6_69},
  interhash = {aca4272aeae58f92f9b061475f1abf92},
  intrahash = {32b2a0ce65492f420267e700780bb5a2},
  isbn = {3-540-44180-8},
  keywords = {dblp},
  pages = {795-807},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T18:37:31.000+0200},
  title = {Extending Reduction Techniques for the Steiner Tree Problem.},
  url = {http://dblp.uni-trier.de/db/conf/esa/esa2002.html#PolzinD02},
  volume = 2461,
  year = 2002
}

{"_id":"foDWvTCzybzWRMNny","bibbaseid":"polzin-daneshmand-extendingreductiontechniquesforthesteinertreeproblem-2002","author_short":["Polzin, T.","Daneshmand, S. V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-26T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Polzin"],"firstnames":["Tobias"],"suffixes":[]},{"propositions":[],"lastnames":["Daneshmand"],"firstnames":["Siavash","Vahdati"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/232b2a0ce65492f420267e700780bb5a2/dblp","booktitle":"ESA","crossref":"conf/esa/2002","editor":[{"propositions":[],"lastnames":["Möhring"],"firstnames":["Rolf","H."],"suffixes":[]},{"propositions":[],"lastnames":["Raman"],"firstnames":["Rajeev"],"suffixes":[]}],"ee":"https://doi.org/10.1007/3-540-45749-6_69","interhash":"aca4272aeae58f92f9b061475f1abf92","intrahash":"32b2a0ce65492f420267e700780bb5a2","isbn":"3-540-44180-8","keywords":"dblp","pages":"795-807","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T18:37:31.000+0200","title":"Extending Reduction Techniques for the Steiner Tree Problem.","url":"http://dblp.uni-trier.de/db/conf/esa/esa2002.html#PolzinD02","volume":"2461","year":"2002","bibtex":"@inproceedings{conf/esa/PolzinD02,\n added-at = {2017-05-26T00:00:00.000+0200},\n author = {Polzin, Tobias and Daneshmand, Siavash Vahdati},\n biburl = {https://www.bibsonomy.org/bibtex/232b2a0ce65492f420267e700780bb5a2/dblp},\n booktitle = {ESA},\n crossref = {conf/esa/2002},\n editor = {Möhring, Rolf H. and Raman, Rajeev},\n ee = {https://doi.org/10.1007/3-540-45749-6_69},\n interhash = {aca4272aeae58f92f9b061475f1abf92},\n intrahash = {32b2a0ce65492f420267e700780bb5a2},\n isbn = {3-540-44180-8},\n keywords = {dblp},\n pages = {795-807},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T18:37:31.000+0200},\n title = {Extending Reduction Techniques for the Steiner Tree Problem.},\n url = {http://dblp.uni-trier.de/db/conf/esa/esa2002.html#PolzinD02},\n volume = 2461,\n year = 2002\n}\n\n","author_short":["Polzin, T.","Daneshmand, S. V."],"editor_short":["Möhring, R. H.","Raman, R."],"key":"conf/esa/PolzinD02","id":"conf/esa/PolzinD02","bibbaseid":"polzin-daneshmand-extendingreductiontechniquesforthesteinertreeproblem-2002","role":"author","urls":{"Link":"https://doi.org/10.1007/3-540-45749-6_69","Paper":"http://dblp.uni-trier.de/db/conf/esa/esa2002.html#PolzinD02"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/polzin?items=1000","dataSources":["L92qcuQyWy6p4hiBM"],"keywords":["dblp"],"search_terms":["extending","reduction","techniques","steiner","tree","problem","polzin","daneshmand"],"title":"Extending Reduction Techniques for the Steiner Tree Problem.","year":2002}