Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems
暂无分享,去创建一个
[1] Guy Kortsarz. On the Hardness of Approximating Spanners , 2001, Algorithmica.
[2] David Peleg,et al. Strong Inapproximability of the Basic k-Spanner Problem , 2000, ICALP.
[3] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[4] Michael Alekhnovich,et al. Minimum propositional proof length is NP-hard to linearly approximate , 2001, Journal of Symbolic Logic.
[5] David Peleg,et al. The Hardness of Approximating Spanner Problems , 2000, STACS.
[6] Rajeev Motwani,et al. Intractability of Assembly Sequencing: Unit Disks in the Plane , 1996, WADS.
[7] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[8] Irit Dinur,et al. On the hardness of approximating label-cover , 2004, Inf. Process. Lett..
[9] Jacques Stern,et al. The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[10] Robert D. Carr,et al. On the red-blue set cover problem , 2000, SODA '00.