Thomas Erlebach. Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. In Jiri Sgall, Ales Pultr, Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Volume 2136 of Lecture Notes in Computer Science, pages 351-362, Springer, 2001. [doi]
Abstract is missing.