36 search results - page 2 / 8 » On the Optimality of Planar and Geometric Approximation Sche... |
DISOPT
2010
13 years 5 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
CG
2005
Springer
13 years 5 months ago
2005
Springer
Many applications of geometry processing and computer vision rely on geometric properties of curves, particularly their curvature. Several methods have already been proposed to est...
JCO
2010
13 years 3 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
DCOSS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
LION
2009
Springer
14 years 21 hour ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...