659 search results - page 106 / 132 » Dynamic Algorithms for Graph Spanners |
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
106
click to vote
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
88
Voted
JCP
2006
14 years 10 months ago
2006
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
92
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...