Abstract
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sources and sinks) on the boundary of a rectangle where either the longest path length or the total path length is minimized. One algorithm finds the set of disjoint paths with the longest path length minimized in O(n log n) time and the other finds the set of disjoint paths with the total path length minimized in O(n 2) time. In particular, if the sets of sources and sinks lie on a straight line, the set of disjoint paths with the minimum longest path length or minimum total path length can be found in O(n) or O(n 2) time respectively.
The research is partially supported by an RGC grant 338/065/0022.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flow: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
W.-T. Chan and F. Y. L. Chin, Efficient algorithms for finding disjoint paths in grids (extended abstract), in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 454–463.
W.-T. Chan and F. Y. L. Chin, Linear-time algorithms for unspecified routing in grids, in ICS'96-International Conference on Algorithms, 1996, pp. 79–85.
A. Frank, Packing paths, circuits, and cuts — a survey, Paths, Flows, and VLSI-Layout, Springer-Verlag, Berlin, (1990), pp. 47–100.
A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, Algorithms for routing around a rectangle, DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 40 (1992), pp. 363–378.
T. F. Gonzalez and S.-L. Lee, A linear time algorithm for optimal routing around a rectangle, J. ACM, 35 (1988), pp. 810–831.
A. Hashimoto and J. E. Stevens, Wire routing by optimizing channel assignment without large apertures, in Proceedings of the 8th IEEE Design Automation Conference, 1971, pp. 155–169.
S. Khuller and J. Naor, Flow in planar graphs with vertex capacities, Algorithmica, 11 (1994), pp. 200–225.
M. R. Kramer and J. van Leeuwen, The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits, Advances in Computing Research, (1984), pp. 129–146.
K. Mehlhorn and F. P. Preparata, Routing through a rectangle, J. ACM, 33 (1986), pp. 60–85.
G. L. Miller and J. Naor, Flow in planar graphs with multiple sources and sinks (extended abstract), in Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science, 1989, pp. 112–117.
H. Ripphausen-Lipa, D. Wagner, and K. Weihe, Efficient algorithms for disjoint paths in planar graphs, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., (1995), pp. 295–354.
H. Ripphausen-Lipa, D. Wagner, and K. Weihe, The vertex-disjoint Menger problem in planar graphs, SIAM J. Comput., (1997), pp. 331–349.
F. F. Yao, Speed-up in dynamic programming, SIAM J. Alg. Disc. Meth., 3 (1982), pp. 532–540.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, WT., Chin, F.Y.L. (1997). Algorithms for finding optimal disjoint paths around a rectangle. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_34
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive