When crossings count - approximating the minimum spanning tree. Har-Peled, S. & Indyk, P. In Proceedings of Symposium on Computational Geometry (SoCG), pages 166-175, 2000. ![When crossings count - approximating the minimum spanning tree [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @inproceedings{ dblp4386464,
title = {When crossings count - approximating the minimum spanning tree},
author = {Sariel Har-Peled and Piotr Indyk},
author_short = {Har-Peled, S. and Indyk, P.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2000},
key = {dblp4386464},
id = {dblp4386464},
biburl = {http://www.dblp.org/rec/bibtex/conf/compgeom/Har-PeledI00},
url = {http://doi.acm.org/10.1145/336154.336197},
conference = {SoCG},
pages = {166-175},
text = {SoCG 2000:166-175},
booktitle = {Proceedings of Symposium on Computational Geometry (SoCG)}
}
Downloads: 0
{"_id":"Rn2GetwcLjP4jsm65","bibbaseid":"harpeled-indyk-whencrossingscountapproximatingtheminimumspanningtree-2000","downloads":0,"creationDate":"2016-02-19T04:14:21.901Z","title":"When crossings count - approximating the minimum spanning tree","author_short":["Har-Peled, S.","Indyk, P."],"year":2000,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/compgeom/Har-PeledI00","bibdata":{"title":"When crossings count - approximating the minimum spanning tree","author":["Sariel Har-Peled","Piotr Indyk"],"author_short":["Har-Peled, S.","Indyk, P."],"bibtype":"inproceedings","type":"inproceedings","year":"2000","key":"dblp4386464","id":"dblp4386464","biburl":"http://www.dblp.org/rec/bibtex/conf/compgeom/Har-PeledI00","url":"http://doi.acm.org/10.1145/336154.336197","conference":"SoCG","pages":"166-175","text":"SoCG 2000:166-175","booktitle":"Proceedings of Symposium on Computational Geometry (SoCG)","bibtex":"@inproceedings{ dblp4386464,\n title = {When crossings count - approximating the minimum spanning tree},\n author = {Sariel Har-Peled and Piotr Indyk},\n author_short = {Har-Peled, S. and Indyk, P.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2000},\n key = {dblp4386464},\n id = {dblp4386464},\n biburl = {http://www.dblp.org/rec/bibtex/conf/compgeom/Har-PeledI00},\n url = {http://doi.acm.org/10.1145/336154.336197},\n conference = {SoCG},\n pages = {166-175},\n text = {SoCG 2000:166-175},\n booktitle = {Proceedings of Symposium on Computational Geometry (SoCG)}\n}","bibbaseid":"harpeled-indyk-whencrossingscountapproximatingtheminimumspanningtree-2000","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/336154.336197"},"downloads":0},"search_terms":["crossings","count","approximating","minimum","spanning","tree","har-peled","indyk"],"keywords":[],"authorIDs":[],"dataSources":["fLcQE9LJaroGmiRCm"]}