New Reoptimization Techniques applied to Steiner Tree Problem

DOI10.1016/j.endm.2011.05.066zbMath1268.90073OpenAlexW2050037074MaRDI QIDQ2840741

Anna Zych, Davide Bilò

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.066

zbMATH Keywords

approximationSteiner tree problemreoptimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of NP-Hard Problems ⋮ Unnamed Item ⋮ Fixing improper colorings of graphs ⋮ Reoptimization in machine scheduling ⋮ New Reoptimization Techniques applied to Steiner Tree Problem ⋮ REOPTIMIZATION UNDER VERTEX INSERTION: MAX P_k-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Reoptimization of Steiner trees: changing the terminal set
• An 11/6-approximation algorithm for the network Steiner problem
• New Reoptimization Techniques applied to Steiner Tree Problem
• An improved LP-based approximation for steiner tree
• Reoptimization of Steiner Trees
• Reoptimization of the Metric Deadline TSP
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of the Shortest Common Superstring Problem
• Reoptimization of Minimum and Maximum Traveling Salesman’s Tours

This page was built for publication: New Reoptimization Techniques applied to Steiner Tree Problem