by Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
In Proceedings of ICALP ’99: the 26th International Colloquium on Automata, Languages and Programming
http://www.lab2.kuis.kyoto-u.ac.jp/~shuichi/research/icalp071.ps
Add To MetaCart
Abstract:
Abstract. The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ones: one is to allow an incomplete list, i.e., a man is permitted to accept only a subset of the women and vice versa. The other is to allow a preference list including ties. Fortunately, it is known that both relaxed problems can still be solved in polynomial time. In this paper, we show that the situation changes substantially if we allow both relaxations (incomplete lists and ties) at the same time: the problem not only becomes NP-hard, but also the optimal cost version has no approximation algorithm achieving the approximation ratio of N
Citations
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
211
|
College admissions and the stability of marriage
– Gale, Shapley
- 1962
|
|
195
|
Free bits, PCPs, and nonapproximability-- towards tight results
– Bellare, Goldreich, et al.
- 1998
|
|
137
|
Zero-knowledge and the chromatic number
– Feige, Kilian
- 1998
|
|
130
|
The stable Marriage Problem: Structure and Algorithms
– Gusfield, Irving
- 1989
|
|
127
|
Approximating maximum independent sets by excluding subgraps
– Boppana, Hald'orsson
- 1992
|
|
29
|
Some remarks on the stable matching problem
– Gale, Sotomayor
- 1985
|
|
26
|
Stable marriage and indifference
– Irving
- 1994
|
|
20
|
Clique is hard to approximate within
– Hastad
- 1996
|
|
20
|
NP-complete stable matching problems
– Ronn
- 1990
|
|
10
|
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
– Kann
- 1995
|
|
6
|
On the approximability of the maximum common subgraph problem
– Kann
- 1992
|
|
1
|
c 1− >N c , which completes the proof
– unknown authors
|
|
1
|
On the hardness of approximating minimization problems: in comparison with maximization classes
– Ohguro
- 1995
|
|
1
|
Ronn,“NP-complete stable matching problems
– unknown authors
- 1990
|
|
1
|
Clique is hard to approximate within n 10ffl
– Hastad
- 1996
|
