2944 search results - page 181 / 589 » Improving Bound Propagation |
FCT
2007
Springer
14 years 4 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
WAOA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
GLVLSI
1996
IEEE
14 years 2 months ago
1996
IEEE
Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving p...