7930 search results - page 235 / 1586 » Greedy in Approximation Algorithms |
172
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
182
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
152
click to vote
IJRR
2006
15 years 6 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
150
click to vote
EOR
2007
15 years 6 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
160
click to vote
CCCG
2006
15 years 8 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...