Presentation 2005-05-20
Improving a local search approximation algorithm for the stable marriage problem
Naoya YAMAUCHI, Shuichi MIYAZAKI, Kazuo IWAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowed in preference lists. This problem is NP-hard and the current best known approximation algorithm achieves the approximation ratio 2-c (logN)/N, where c is an arbitrary positive constant and N is the number of men in an input. In this paper, we improve the ratio to 2-c 1/(N^<2/3>), where c is a constant such that c≦1/(2(√^3<6>)).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) the stable marriage problem / incomplete lists / ties / approximation algorithms / local search
Paper # COMP2005-15
Date of Issue

Conference Information
Committee COMP
Conference Date 2005/5/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improving a local search approximation algorithm for the stable marriage problem
Sub Title (in English)
Keyword(1) the stable marriage problem
Keyword(2) incomplete lists
Keyword(3) ties
Keyword(4) approximation algorithms
Keyword(5) local search
1st Author's Name Naoya YAMAUCHI
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Shuichi MIYAZAKI
2nd Author's Affiliation Academic Center for Computing and Media Studies, Kyoto University
3rd Author's Name Kazuo IWAMA
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2005-05-20
Paper # COMP2005-15
Volume (vol) vol.105
Number (no) 72
Page pp.pp.-
#Pages 7
Date of Issue