A note on distributed stable matching

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2009, Pages 466-473

  Kipnis, Alex ^a   Patt Shamir, Boaz ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION GRAPHS; COMMUNICATION LINKS; COMMUNICATION ROUNDS; DISTRIBUTED ALGORITHM; DISTRIBUTED MODELS; LOWER BOUNDS; STABLE MARRIAGE PROBLEM; STABLE MATCHING; TIME COMPLEXITY; WORST CASE;

COMPUTER SCIENCE; CONTROL THEORY; FARM BUILDINGS; GRAPH THEORY; PARALLEL ALGORITHMS; SYSTEM STABILITY; TECHNICAL PRESENTATIONS;

COMMUNICATION;

EID: 70350222220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2009.69     Document Type: Conference Paper

References (11)

1. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar. Matching output queueing with a combined input output queued switch. IEEE Journal on Selected Areas in Communications, 17(6):1030-1039, June 1999.
2. M. Elkin. An unconditional lower bound on the time-approximation tradeoff for the minimum spanning tree problem. SIAM J. Comput., 36(2):463-501, 2006.
3. D. Gale and L. S. Shapley. College admissions and the stability of marriage. American Math. Monthly, 69:9-15, 1962.
4. D. Gusfield and R. W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, USA, 1989.
5. M. M. Halldórsson, R. Irving, K. Iwama, and D. Manlove, editors. MATCH-UP: Matching Under Preferences, Reykjavk, Iceland, Mar. 2008. Satellite workshop of ICALP 2008. http://www.dcs.gla.ac.uk/research/algorithms/ workshop/.
6. M. M. Halldórsson, K. Iwama, S. Miyazaki, and Y. Morita. Inapproximability results on stable marriage problems. In LATIN '02: Proc. 5th Latin American Symp. on Theoretical Informatics, pages 554-568, London, UK, 2002. Springer-Verlag.
7. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In Proc. 17th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 980-989, New York, NY, USA, 2006. ACM.
8. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006.
9. Z. Lotker, B. Patt-Shamir, and S. Pettie. Improved distributed approximate matching. In Proc. ACM Symposium on Parallellism in Algorithms and Architecture, pages 129-136, New York, NY, USA, 2008. ACM.
10. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
11. D. Peleg and V. Rubinovich. Near-tight lower bound on the time complexity of distributed MST construction. SIAM J. Comput., 30:1427-1442, 2000.