Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles

Matthias Müller-Hannemann, Sven Peyer. Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid, editors, Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Volume 2748 of Lecture Notes in Computer Science, pages 207-218, Springer, 2003. [doi]

@inproceedings{Muller-HannemannP03,
  title = {Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles},
  author = {Matthias Müller-Hannemann and Sven Peyer},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2748&spage=207},
  researchr = {https://researchr.org/publication/Muller-HannemannP03},
  cites = {0},
  citedby = {0},
  pages = {207-218},
  booktitle = {Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Michiel H. M. Smid},
  volume = {2748},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40545-3},
}