@incollection{halperin_near-tight_2008,
	address = {Berlin, Heidelberg},
	title = {A {Near}-{Tight} {Bound} for the {Online} {Steiner} {Tree} {Problem} in {Graphs} of {Bounded} {Asymmetry}},
	volume = {5193},
	url = {http://www.springerlink.com/content/31j55836314j723q/},
	urldate = {2011-08-04TZ},
	booktitle = {Algorithms - {ESA} 2008},
	publisher = {Springer Berlin Heidelberg},
	author = {Angelopoulos, S.},
	editor = {Halperin, D. and Mehlhorn, K.},
	year = {2008},
	pages = {76--87}
}

{"_id":"uAu2vZTKbd2QSa9u2","bibbaseid":"angelopoulos-aneartightboundfortheonlinesteinertreeproblemingraphsofboundedasymmetry-2008","downloads":0,"creationDate":"2016-12-19T20:50:58.669Z","title":"A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry","author_short":["Angelopoulos, S."],"year":2008,"bibtype":"incollection","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"incollection","type":"incollection","address":"Berlin, Heidelberg","title":"A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry","volume":"5193","url":"http://www.springerlink.com/content/31j55836314j723q/","urldate":"2011-08-04TZ","booktitle":"Algorithms - ESA 2008","publisher":"Springer Berlin Heidelberg","author":[{"propositions":[],"lastnames":["Angelopoulos"],"firstnames":["S."],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Halperin"],"firstnames":["D."],"suffixes":[]},{"propositions":[],"lastnames":["Mehlhorn"],"firstnames":["K."],"suffixes":[]}],"year":"2008","pages":"76--87","bibtex":"@incollection{halperin_near-tight_2008,\n\taddress = {Berlin, Heidelberg},\n\ttitle = {A {Near}-{Tight} {Bound} for the {Online} {Steiner} {Tree} {Problem} in {Graphs} of {Bounded} {Asymmetry}},\n\tvolume = {5193},\n\turl = {http://www.springerlink.com/content/31j55836314j723q/},\n\turldate = {2011-08-04TZ},\n\tbooktitle = {Algorithms - {ESA} 2008},\n\tpublisher = {Springer Berlin Heidelberg},\n\tauthor = {Angelopoulos, S.},\n\teditor = {Halperin, D. and Mehlhorn, K.},\n\tyear = {2008},\n\tpages = {76--87}\n}\n\n","author_short":["Angelopoulos, S."],"editor_short":["Halperin, D.","Mehlhorn, K."],"key":"halperin_near-tight_2008","id":"halperin_near-tight_2008","bibbaseid":"angelopoulos-aneartightboundfortheonlinesteinertreeproblemingraphsofboundedasymmetry-2008","role":"author","urls":{"Paper":"http://www.springerlink.com/content/31j55836314j723q/"},"downloads":0,"html":""},"search_terms":["near","tight","bound","online","steiner","tree","problem","graphs","bounded","asymmetry","angelopoulos"],"keywords":[],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}