7006 search results - page 606 / 1402 » Approximation Algorithms |
215
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
190
click to vote
WEA
2005
Springer
16 years 21 days ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
173
click to vote
FOCM
2008
15 years 7 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
173
click to vote
TCOM
2010
15 years 1 months ago
2010
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...
171
Voted
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...