Abstract
Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual” edges and “potential” edges. In addition, each vertex has a degree/interface constraint. We wish to compute a shortest path in the graph that maintains feasibility when we convert the potential edges on the shortest path to actual edges. The central difficulty is when a node has only one free interface, and the unconstrained shortest path chooses two potential edges incident on this node. We first show that this problem can be solved in polynomial time by reducing it to the minimum weighted perfect matching problem. The number of steps taken by this algorithm is O(|E|2 log |E|) for the single-source single-destination case. In other words, for each v we compute the shortest path P v such that converting the potential edges on P v to actual edges, does not violate any degree constraint. We then develop more efficient algorithms by extending Dijkstra’s shortest path algorithm. The number of steps taken by the latter algorithm is O(|E||V|), even for the single-source all destination case.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Cook, W., Rohe, A.: Computing Minimum Weight Perfect Matchings. INFORMS Journal of Computing (1998)
Fekete, S., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.: A Network-Flow technique for finding low-weight bounded-degree spanning trees. Journal of Algorithms 24, 310–324 (1997)
Fürer, M., Raghavachari, B.: Approximating the minimum degree Steiner tree to within one of optimal. Journal of Algorithms 17, 409–423 (1994)
Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pp. 434–443 (1990)
Gabow, H.N., Tarjan, R.E.: Efficient algorithms for a family of matroid intersection problems. Journal of Algorithms 5, 80–131 (1984)
Gurumohan, P., Hui, J.: Topology Design for Free Space Optical Network. In: ICCCN 2003 (October 2003)
Huang, Z., Shen, C.-C., Srisathapornphat, C., Jaikaeo, C.: Topology Control for Ad Hoc Networks with Directional Antennas. In: ICCCN 2002, Miami, Florida (October 2002)
Kashyap, A., Lee, K., Shayman, M.: Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. Technical Report, Institute for System Research, University of Maryland (2003)
Könemann, J., Ravi, R.: Primal-dual algorithms come of age: approximating MST’s with non-uniform degree bounds. In: Proc. of the 35th Annual Symp. on Theory of Computing, pp. 389–395 (2003)
Koo, S., Sahin, G., Subramaniam, S.: Dynamic LSP Provisioning in Overlay, Augmented, and Peer Architectures for IP/MPLS over WDM Networks. In: IEEE INFOCOM (March 2004)
Lee, K., Shayman, M.: Optical Network Design with Optical Constraints in Multi-hop WDM Mesh Networks. In: ICCCN 2004 (October 2004)
Leonardi, E., Mellia, M., Marsan, M.A.: Algorithms for the Logical Topology Design in WDM All-Optical Networks. In: Optical Networks Magazine, pp. 35–46 (January 2000)
Riza, N.A.: Reconfigurable Optical Wireless. In: LEOS 1999, vol.1, pp. 8–11 (November 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khuller, S., Lee, K., Shayman, M. (2005). On Degree Constrained Shortest Paths. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_25
Download citation
DOI: https://doi.org/10.1007/11561071_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)