@inproceedings{ dblp4024758,
  title = {The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation},
  author = {Marc Benkert and Alexander Wolff and Florian Widmann},
  author_short = {Benkert, M. and Wolff, A. and Widmann, F.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2004},
  key = {dblp4024758},
  id = {dblp4024758},
  biburl = {http://www.dblp.org/rec/bibtex/conf/jcdcg/BenkertWW04},
  url = {http://dx.doi.org/10.1007/11589440_2},
  conference = {JCDCG},
  pages = {16-28},
  text = {JCDCG 2004:16-28},
  booktitle = {Proceedings of Japanese Conference on Discrete and Computational Geometry (JCDCG)}
}

{"_id":"ASnaGaSCpr4ZBsQMG","bibbaseid":"benkert-wolff-widmann-theminimummanhattannetworkproblemafastfactor3approximation-2004","downloads":0,"creationDate":"2016-02-19T09:28:44.774Z","title":"The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation","author_short":["Benkert, M.","Wolff, A.","Widmann, F."],"year":2004,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/jcdcg/BenkertWW04","bibdata":{"title":"The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation","author":["Marc Benkert","Alexander Wolff","Florian Widmann"],"author_short":["Benkert, M.","Wolff, A.","Widmann, F."],"bibtype":"inproceedings","type":"inproceedings","year":"2004","key":"dblp4024758","id":"dblp4024758","biburl":"http://www.dblp.org/rec/bibtex/conf/jcdcg/BenkertWW04","url":"http://dx.doi.org/10.1007/11589440_2","conference":"JCDCG","pages":"16-28","text":"JCDCG 2004:16-28","booktitle":"Proceedings of Japanese Conference on Discrete and Computational Geometry (JCDCG)","bibtex":"@inproceedings{ dblp4024758,\n title = {The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation},\n author = {Marc Benkert and Alexander Wolff and Florian Widmann},\n author_short = {Benkert, M. and Wolff, A. and Widmann, F.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2004},\n key = {dblp4024758},\n id = {dblp4024758},\n biburl = {http://www.dblp.org/rec/bibtex/conf/jcdcg/BenkertWW04},\n url = {http://dx.doi.org/10.1007/11589440_2},\n conference = {JCDCG},\n pages = {16-28},\n text = {JCDCG 2004:16-28},\n booktitle = {Proceedings of Japanese Conference on Discrete and Computational Geometry (JCDCG)}\n}","bibbaseid":"benkert-wolff-widmann-theminimummanhattannetworkproblemafastfactor3approximation-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/11589440_2"},"downloads":0},"search_terms":["minimum","manhattan","network","problem","fast","factor","approximation","benkert","wolff","widmann"],"keywords":[],"authorIDs":[],"dataSources":["REjTL5bT7hLFTniy9"]}