Improved approximation bounds for the Student-Project Allocation problem with preferences over projects
スポンサーリンク
概要
- 論文の詳細を見る
Manlove and OʼMalley (2008) proposed the Student-Project Allocation problem with Preferences over Projects (SPA-P). They proved that the problem of finding a maximum stable matching in SPA-P is APX-hard and gave a polynomial-time 2-approximation algorithm. In this paper, we give an improved upper bound of 1.5 and a lower bound of 21/19 (>1.1052).
論文 | ランダム
- 高速エンドミル加工の切削現象に関する研究(第2報) -工具ねじれ角が切削抵抗及び工具摩耗に及ぼす影響-
- Fluorescence Lifetime of Organic Thin Films Alternately Deposited with Diamine Derivative and Aluminum Quinoline
- Actual Emitting Region in Organic Electroluminescent Diodes with Multilayer Structure
- Electrical and Luminescent Properties of Color-Changeable Organic Electroluminescent Diode Using Squarylium Dyes
- Independent grammatical study: a look into the performance and motivation of 1st year English majors