5595 search results - page 73 / 1119 » Approximation Algorithms for Clustering Problems |
130
click to vote
SSD
2005
Springer
15 years 10 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
153
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
149
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
174
click to vote
PR
2008
15 years 4 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
161
click to vote
EUSFLAT
2009
15 years 2 months ago
2009
Group technology (GT) is a useful way to increase productivity with high quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a key step in the GT phil...