General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems
- 作者Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten
- 卷第7卷
- 期第3期
- 印刷ISSN1572-5286
- 文件大小482.23KB
- 发表时间2010
- DOI10.1016/j.disopt.2010.03.004
- 页码136-148
同作者推荐
Complexity of the min–max and min–max regret assignment problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2005
Complexity of the min–max (regret) versions of min cut problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2008
Min–max and min–max regret versions of combinatorial optimization problems: A surveyHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2009
Approximation of min–max and min–max regret versions of some combinatorial optimization problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2007