5595 search results - page 165 / 1119 » Approximation Algorithms for Clustering Problems |
142
Voted
MP
1998
15 years 4 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
144
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
161
click to vote
FSTTCS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
135
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
127
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper deals with overlapping clustering, a trade off between crisp and fuzzy clustering. It has been motivated by recent applications in various domains such as information r...