Sciweavers

3678 search results - page 128 / 736
» On the Stable Paths Problem
Sort
View
ECCC
2007
147views more  ECCC 2007»
15 years 18 days ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
104
Voted
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 6 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
MOBICOM
2003
ACM
15 years 6 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
94
Voted
BROADNETS
2005
IEEE
15 years 6 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
INFOCOM
2005
IEEE
15 years 6 months ago
Interference-aware routing in multihop wireless networks using directional antennas
— Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interference-aware topolog...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...