Path Coloring on the Mesh

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al [1] and Raghavan and Upfal [22] as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O(ln N) approximation result of Kleinberg and Tardos [14] for path coloring on the N

• Type: Conference
• Year: 1996
• Where: FOCS
• Authors: Yuval Rabani
• Keywords: Approximation Algorithm, FOCS 1996, Path Coloring, Path Coloring Problem, Theoretical Computer Science