5595 search results - page 140 / 1119 » Approximation Algorithms for Clustering Problems |
127
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
122
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
128
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
133
click to vote
AAAI
2004
15 years 6 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
130
Voted
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...