2137 search results - page 359 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
146
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
170
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
130
Voted
ICIP
2005
IEEE
16 years 6 months ago
2005
IEEE
Appropriate rate control plays a very important role in encoding motion pictures under the constant bit-rate. One of the requirements for rate control is minimizing temporal fluct...
149
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
144
click to vote
SODA
2008
ACM
15 years 6 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...