Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. Disser, Y.; Mihalák, M.; Montanari, S.; and Widmayer, P. In Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, pages 208–220, 2014.

Paper doi bibtex

@INPROCEEDINGS{DisserMM2014IP,
  author = {Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Sandro Montanari and
	Peter Widmayer},
  title = {{R}ectilinear {S}hortest {P}ath and {R}ectilinear {M}inimum {S}panning
	{T}ree with {N}eighborhoods},
  booktitle = {Combinatorial Optimization - Third International Symposium, {ISCO}
	2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
  year = {2014},
  pages = {208--220},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {http://dblp.uni-trier.de/rec/bib/conf/iscopt/DisserMMW14},
  crossref = {DBLP:conf/iscopt/2014},
  doi = {10.1007/978-3-319-09174-7_18},
  timestamp = {Wed, 08 Oct 2014 14:42:30 +0200},
  url = {http://dx.doi.org/10.1007/978-3-319-09174-7_18}
}

Downloads: 0