642 search results - page 62 / 129 » Approximation Algorithms for Minimum K-Cut |
125
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
108
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
100
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
130
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
107
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...