Sciweavers

177 search results - page 5 / 36
» Link Distance and Shortest Path Problems in the Plane
Sort
View
ALGORITHMICA
2011
13 years 3 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 6 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Efstathios Bakolas, Panagiotis Tsiotras
ORL
2008
99views more  ORL 2008»
13 years 8 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
IPPS
2007
IEEE
14 years 2 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
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 8 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...