3 search results - page 1 / 1 » Faster Parameterized Algorithms for Minor Containment |
66
Voted
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...