Sciweavers

422 search results - page 21 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
COMGEO
2010
ACM
13 years 7 months ago
Highway hull revisited
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
ICRA
2006
IEEE
130views Robotics» more  ICRA 2006»
14 years 1 months ago
Voronoi Diagram and Fast Marching applied to Path Planning
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...
Santiago Garrido, Luis Moreno, Dolores Blanco
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 2 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
NETWORKS
2007
13 years 7 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei