2796 search results - page 168 / 560 » The coolest path problem |
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
163
click to vote
CCCG
1993
15 years 7 months ago
1993
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
223
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
161
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...