7129 search results - page 425 / 1426 » Approximation Algorithms for Treewidth |
148
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
136
click to vote
AAECC
1995
Springer
15 years 9 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
137
click to vote
CCCG
2010
15 years 7 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
166
click to vote
CCCG
2010
15 years 7 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
215
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...