598 search results - page 45 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
ALGOSENSORS
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
IPL
2008
13 years 8 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
JC
2007
13 years 8 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
WSCG
2000
13 years 9 months ago
2000
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...