Thumbnail

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érence
Date
2006
Conference country
TAIWAN, PROVINCE OF CHINA
Book title
Computing and Combinatorics 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
Book author
Lee, D.T.
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-540-36925-7
Pages
428-438
Metadata
Show full item record
Author(s)
Aissi, Hassene

Bazgan, Cristina

Vanderpooten, Daniel
Abstract (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 tree