The AI conference paper assignment problem

AAAI Workshop - Technical Report

Volumn WS-07-10, Issue , 2007, Pages 53-57

  Goldsmith, Judy ^a   Sloan, Robert H ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b University of Illinois at Chicago   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT ALGORITHMS; ASSIGNMENT PROBLEM; PROGRAM COMMITTEE; TECHNICAL REPORTS;

ARTIFICIAL INTELLIGENCE; CHLORINE COMPOUNDS; WIRELESS TELECOMMUNICATION SYSTEMS;

TRAVELING SALESMAN PROBLEM;

EID: 51849146503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Baïou, M., and Balinski, M. 2000. Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics 101:1-12.
2. Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2001. Introduction to Algorithms. Cambridge, MA: MIT Press, second edition.
3. Gale, D., and Shapley, L. 1962. College admissions and the stability of marriage. American Mathematics Monthly 9-15.
4. Gusfield, D., and Irving, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. The MIT Press.
5. Irving, R.; Manlove, D.; and O'Malley, G. 2006. Stable marriage with ties and bounded length preference lists. In Proc. ACID, Volume 7 of Texts in Algorithmes, 95-106. College Publications.
6. Iwama, K.; Miyazak, S.; and Yamauchi, N. 2007. A 1.875-approximation algorithm for the stable marriage problem. In Proc. SODA 2007.
7. Iwama, K.; Miyazaki, S.; and Okamoto, K. 2006. A - c log n/n -approximation algorithm for the stable marriage problem. IEICE Trans. Info and Systems E-89D:2380-2387. Preliminary version appeared in SWAT 2004.
8. Jungnickel, D. 2005. Graphs, Networks and Algorithms, volume 5 of Algorithms and Computation in Mathematics. Springer, second edition.
9. Manlove, D.; Irving, R.; Iwama, K.; Miyazaki, S.; and Morita, Y. 2002. Hard variants of stable marriage. Theoretical Computer Science 276:261-279.
10. Wegener, I. 2005. Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer.