11 search results - page 1 / 3 » Fractional Matching Via Balls-and-Bins |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
WDAG
2009
Springer
13 years 12 months ago
2009
Springer
STOC
2010
ACM
13 years 10 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
ICC
2009
IEEE
14 years 4 days ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...