On Degree Constrained Shortest Paths

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 Ç´ ¾ ÐÓ µ for the single-source singledestination case. In other words, for each Ú we compute the shortest path ÈÚ such that converting the potentia...

• Type: Conference
• Year: 2005
• Where: ESA
• Authors: Samir Khuller, Kwangil Lee, Mark A. Shayman
• Keywords: ESA 2005, Potential Edges, Shortest Path, Shortest Path Problem