• 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

What about future? Robustness under vertex-uncertainty in graph-problems

Murat, Cécile; Paschos, Vangelis (2006), What about future? Robustness under vertex-uncertainty in graph-problems. https://basepub.dauphine.fr/handle/123456789/20907

View/Open
cahier_236.pdf (382.8Kb)
Type
Document de travail / Working paper
Date
2006
Series title
Cahier du LAMSADE
Series number
236
Published in
Paris
Metadata
Show full item record
Author(s)
Murat, Cécile
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We study a robustness model for graph-problems under vertex-uncertainty. We assume that any vertex vi of the input-graph G(V,E) has only a probability pi to be present in the final graph to be optimized (i.e., the final instance for the problem tackled will be only a sub-graph of the initial graph). Under this model, the original "deterministic" problem gives rise to a new (deterministic) problem on the same input-graph G, having the same set of feasible solutions as the former one, but its objective function can be very different from the original one, the set of its optimal solutions too. Moreover, this objective function is a sum of 2 / v / terms; hence, its computation is not immediately polynomial. We give sufficient conditions for large classes of graph-problems under which objective functions of the robust counterparts are polynomially computable and optimal solutions are well-characterized. Finally, we apply these general results to natural and well-known representatives of any of the classes considered.
Subjects / Keywords
graph-problems

Related items

Showing items related by title and author.

  • Thumbnail
    Vertex-uncertainty in graph-problems 
    Murat, Cécile; Paschos, Vangelis (2008) Communication / Conférence
  • Thumbnail
    Probabilistic optimization in graph-problems 
    Paschos, Vangelis; Murat, Cécile (2010) Article accepté pour publication ou publié
  • Thumbnail
    The probabilistic minimum vertex covering problem 
    Paschos, Vangelis; Murat, Cécile (2002) Article accepté pour publication ou publié
  • Thumbnail
    Probabilistic graph-coloring in bipartite and split graphs 
    Murat, Cécile; Escoffier, Bruno; Della Croce, Federico; Bourgeois, Nicolas; Paschos, Vangelis (2009) Article accepté pour publication ou publié
  • Thumbnail
    A new single model and derived algorithms for the satellite shots planning problem using graph theory concepts 
    Gabrel, Virginie; Moulet, Alain; Murat, Cécile; Paschos, Vangelis (1997) Article accepté pour publication ou publié
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