Fractional matching via balls-and-bins

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 487-498

  Motwani, Rajeev ^a   Panigrahy, Rina ^a   Xu, Ying ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EDGE DETECTION; INTERACTIVE COMPUTER GRAPHICS; PROBLEM SOLVING; RANDOM PROCESSES;

BIPARTITE GRAPHS; FRACTIONAL MATCHING; WEIGHTED SUBGRAPHS;

GRAPH THEORY;

EID: 33750083024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_44     Document Type: Conference Paper

References (22)

1. R.K, Ahuja, T.L. Magnanti, and J.B, Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
2. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. "Balanced allocations." SIAM Journal on Computing, 29:180-200, 1999.
3. Y. Azar and A. Litichevskey. "Maximizing throughput in multi-queue switches." In Proceedings of 12th ESA Conference, 2004.
4. P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. "Balanced allocations: The heavily loaded case." In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 745-754, 2000.
5. D.P. Bertsekas. "The Auction Algorithm: A Distributed Relaxation Method for the Assignment Problem." Annals of Operations Research, 14:105-123, 1988.
6. B.V. Cherkassky, A.V. Goldberg, P. Martin, J.C. Setubal, and J. Stolfi. "Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms." ACM J. Exp. Algorithmics, 3, 1998.
7. T. Cormen, C. Leiserson, R. Rivest and C. Stein. Introduction to Algorithms. Second Edition. MIT Press, 2001.
8. N. Garg and J. Könemann. "Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems." In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp.300-309, 1998.
9. A.V.Goldberg. "A natural randomization strategy for multicommodity flow and related algorithms." In Information Processing Letters, 42(5):249-256, 1992.
10. 5/2 algorithm for maximum matchings in bipartite graphs." SIAM Journal on Computing, 2:225-231, 1973.
11. H.W. Kuhn. "The Hungarian method for the assignment problem." Naval Res. Logist. Quart., 2:83-97, 1955.
12. B. Kalyanasundaram and K.R. Pruhs. "An optimal deterministic algorithm for online b-matching." Theoretical Computer Science, 233:319-325, 2000.
13. R.M. Karp, U.V. Vazirani, and V.V. Vazirani. "An optimal algorithm for online bipartite matching." In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
14. L. Lovasz and M.D. Plummer. Matching Theory. Annals of Discrete Mathematics. North Holland, 1986.
15. R. Motwani, R. Panigrahy and Y. Xu. "Fraction Matching via Balls-and-Bins." Technical Report, 2005.
16. A. Mehta, A. Saberi, U.V. Vazirani and V.V. Vazirani. "AdWords and Generalized On-line Matching." In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
17. S. Micali and V. Vazirani. "An O(E√V) algorithm for finding maximum matchings in general graphs." In Proceedings of the 21st IEEE Symposium on the Foundations of Computer Science, pp. 17-27, 1980.
18. R. Panigrahy. "Efficient Hashing with Lookups in Two Memory Accesses." In Proceedings of SODA, 2005.
19. S.A. Plotkin, D. Shmoys, and E. Tardos. "Fast approximation algorithms for fractional packing and covering problems". In Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science, 1991.
20. M. Penn and M. Tennenholtz. "Constrained multi-object auctions and b-matching." Information Processing Letters, 75:29-34, 2000.
21. M. Raab and A. Steger. "Balls into bins - a simple and tight analysis." In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, LNCS volume 1518, pp. 159-170, 1998.
22. M. Tennenholtz. "Tractable combinatorial auctions and b-matching." Artif. Intell., 140:231-243, 2002.