• 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

Simple and fast reoptimizations for the Steiner tree problem

Paschos, Vangelis; Escoffier, Bruno; Milanic, Martin (2009), Simple and fast reoptimizations for the Steiner tree problem, Algorithmic Operations Research, 4, 2, p. 86-94

View/Open
cahierLamsade245.pdf (334.0Kb)
Type
Article accepté pour publication ou publié
Date
2009
Journal name
Algorithmic Operations Research
Volume
4
Number
2
Publisher
Preeminent Academic Facets Inc.
Pages
86-94
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Escoffier, Bruno
Milanic, Martin
Abstract (EN)
We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to maintain a good solution when the instance is subject to minor modifications, the simplest such modifications being vertex insertions and deletions. We propose fast reoptimization strategies for the case of vertex insertions and we show that maintenance of a good solution for the “shrunk” instance, without ex nihilo computation, is impossible when vertex deletions occur. We also provide lower bounds for the approximation ratios of the reoptimization strategies studied.
Subjects / Keywords
Steiner tree; Approximation algorithms; Reoptimization

Related items

Showing items related by title and author.

  • Thumbnail
    Fast Reoptimization for the Minimum Spanning Tree Problem 
    Boria, Nicolas; Paschos, Vangelis (2010) Article accepté pour publication ou publié
  • Thumbnail
    Complexity and approximation results for the min weighted node coloring problem 
    Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage
  • Thumbnail
    A Bottom-Up Method and Fast Algorithms for max independent set 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2010) Communication / Conférence
  • Thumbnail
    Reoptimization of minimum and maximum traveling salesman's tours 
    Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2009) Article accepté pour publication ou publié
  • Thumbnail
    Reoptimization of minimum and maximum traveling salesman's tours 
    Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2006) 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