Sciweavers

422 search results - page 26 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Combinatorial Analysis of Distance Reliability in Star Network
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
Xiaolong Wu, Shahram Latifi, Yingtao Jiang
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
CNSR
2005
IEEE
14 years 1 months ago
Shortest-Hop Based Reliable Network Multicast
Although many multicast communication protocols have been recommended at IETF, reliable multicast communications currently rely on programs built at the application layer, e.g., m...
Ka Lun Eddie Law, Daniel Siu
DEBU
2010
170views more  DEBU 2010»
13 years 7 months ago
Roads Belong in Databases
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
Jagan Sankaranarayanan, Hanan Samet
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts