Stable Assignment with Couples: Parameterized Complexity and Local Search
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Local Search: Is Brute-Force Avoidable? , 2009, IJCAI.
[2] D. Manlove,et al. Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..
[3] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[4] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[5] Eytan Ronn,et al. NP-Complete Stable Matching Problems , 1990, J. Algorithms.
[6] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[7] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[8] Dániel Marx,et al. On the Hardness of Losing Weight , 2008, ICALP.
[9] Noga Alon,et al. Color-coding , 1995, JACM.
[10] David Gale,et al. Some remarks on the stable matching problem , 1985, Discret. Appl. Math..
[11] Dániel Marx,et al. A parameterized view on matroid optimization problems , 2009, Theor. Comput. Sci..
[12] Dániel Marx,et al. Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..
[13] Bettina Klaus,et al. Stable matchings and preferences of couples , 2005, J. Econ. Theory.
[14] Celia A. Glass,et al. Parallel machine scheduling with job assignment restrictions , 2007 .
[15] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .