489 search results - page 3 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
IJRR
2008
13 years 7 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
MOR
2006
13 years 7 months ago
2006
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
STOC
2012
ACM
11 years 10 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...