626 search results - page 104 / 126 » On Approximability of Minimum Bisection Problem |
WAIM
2007
Springer
15 years 7 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
109
click to vote
IPPS
1998
IEEE
15 years 5 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...
116
click to vote
ALT
2010
Springer
15 years 2 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 ...
113
click to vote
SODA
2008
ACM
15 years 2 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...
105
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...