5595 search results - page 443 / 1119 » Approximation Algorithms for Clustering Problems |
167
click to vote
INFORMS
2000
15 years 6 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
213
click to vote
TEC
2008
15 years 6 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
191
click to vote
SIGMOD
2004
ACM
16 years 9 days ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
183
click to vote
EDBTW
2004
Springer
16 years 8 days ago
2004
Springer
This work presents a methodology for grouping structurally similar XML documents using clustering algorithms. Modeling XML documents with tree-like structures, we face the ‘clust...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...