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)

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

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)