• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
polynomial_bazgan.PDF (143.8Kb)
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

Related items

Showing items related by title and author.

  • Thumbnail
    General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2010) Article accepté pour publication ou publié
  • Thumbnail
    Approximation of min-max and min-max regret versions of some combinatorial optimization problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
  • Thumbnail
    Min–max and min–max regret versions of combinatorial optimization problems: A survey 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2009) Article accepté pour publication ou publié
  • Thumbnail
    Pseudo-polynomial algorithms for min-max and min-max regret problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
  • Thumbnail
    Complexity of the min-max (regret) versions of cut problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo