Simple and fast reoptimizations for the Steiner tree problem

MaRDI QIDQ2867366zbMATH OpenFDO

Authors Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/5653

zbMATH Keywords

approximation algorithmsSteiner treereoptimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Reoptimization of Steiner trees: changing the terminal set
• New algorithms for Steiner tree reoptimization
• Robust reoptimization of Steiner trees
• Reoptimization of Steiner Trees
• Robust reoptimization of Steiner trees

Cited in

(29)

• Reoptimization of the shortest common superstring problem
• Reconfiguration of Steiner trees in an unweighted graph
• Reoptimization of Steiner trees: changing the terminal set
• Reoptimization of max \(k\)-cover: approximation ratio threshold
• Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
• Fast reoptimization for the minimum spanning tree problem
• A survey on combinatorial optimization in dynamic environments
• New algorithms for Steiner tree reoptimization
• Reoptimization of set covering problems
• Analysis and experimental study of heuristics for job scheduling reoptimization problems
• New algorithms for Steiner tree reoptimization
• New reoptimization techniques applied to Steiner tree problem
• On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• Reactive tabu search with path-relinking for the Steiner problem in graphs
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
• A theory and algorithms for combinatorial reoptimization
• Reoptimization of Steiner Trees
• A note on the traveling salesman reoptimization problem under vertex insertion
• Reoptimization in machine scheduling
• Robust reoptimization of Steiner trees
• Reoptimization of minimum and maximum traveling salesman's tours
• Reoptimization of the Metric Deadline TSP
• Robust reoptimization of Steiner trees
• Reoptimization of constraint satisfaction problems with approximation resistant predicates
• Reoptimization of the metric deadline TSP
• Knowing all optimal solutions does not help for TSP reoptimization
• Reoptimization of maximum weight induced hereditary subgraph problems
• New advances in reoptimizing the minimum Steiner tree problem

This page was built for publication: Simple and fast reoptimizations for the Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867366)