642 search results - page 94 / 129 » Approximation Algorithms for Minimum K-Cut |
126
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
118
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
140
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
128
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
110
Voted
AIPS
2004
15 years 4 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...