Tree-Approximations for the Weighted Cost-Distance Problem

Christian Schindelhauer, Birgitta Weber. Tree-Approximations for the Weighted Cost-Distance Problem. In Peter Eades, Tadao Takaoka, editors, Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Volume 2223 of Lecture Notes in Computer Science, pages 185-195, Springer, 2001. [doi]

@inproceedings{SchindelhauerW01,
  title = {Tree-Approximations for the Weighted Cost-Distance Problem},
  author = {Christian Schindelhauer and Birgitta Weber},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2223/22230185.htm},
  researchr = {https://researchr.org/publication/SchindelhauerW01},
  cites = {0},
  citedby = {0},
  pages = {185-195},
  booktitle = {Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
  editor = {Peter Eades and Tadao Takaoka},
  volume = {2223},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42985-9},
}