
Approximating min-max (regret) versions of some polynomial problems
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2006), Approximating min-max (regret) versions of some polynomial problems, in Lee, D.T., Computing and Combinatorics 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, Springer : Berlin Heidelberg, p. 428-438
View/ Open
Type
Communication / ConférenceDate
2006Conference country
TAIWAN, PROVINCE OF CHINABook title
Computing and Combinatorics 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, ProceedingsBook author
Lee, D.T.Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-540-36925-7
Pages
428-438
Metadata
Show full item recordAbstract (EN)
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish a general approximation scheme which can be used for min-max and min-max regret versions of some polynomial problems. Applying this scheme to shortest path and minimum spanning tree, we obtain fully polynomial-time approximation schemes with much better running times than the ones previously presented in the literature.Subjects / Keywords
shortest path; approximation; min-max regret; fptas; min-max; minimum spanning treeRelated items
Showing items related by title and author.
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2010) Article accepté pour publication ou publié
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2009) Article accepté pour publication ou publié
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
-
Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence