Refael Hassin, Jérôme Monnot, Danny Segev. Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. In Rastislav Kralovic, Pawel Urzyczyn, editors, Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Volume 4162 of Lecture Notes in Computer Science, pages 480-491, Springer, 2006. [doi]
Abstract is missing.