1279 search results - page 148 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ASPDAC
1999
ACM
15 years 6 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
112
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
136
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
157
Voted
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
109
click to vote
DATAMINE
2006
15 years 2 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...