5595 search results - page 155 / 1119 » Approximation Algorithms for Clustering Problems |
127
Voted
DAM
1999
15 years 4 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
165
Voted
JCO
2008
15 years 5 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
148
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
164
click to vote
DAWAK
2004
Springer
15 years 10 months ago
2004
Springer
Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorith...
145
Voted
LATIN
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...