New algorithms for Steiner tree reoptimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5859273 (Why is no real title available?)
- A note on the traveling salesman reoptimization problem under vertex insertion
- A survey on combinatorial optimization in dynamic environments
- Approximation hardness of deadline-TSP reoptimization
- Complexity and approximation in reoptimization
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Fast reoptimization for the minimum spanning tree problem
- Knowing all optimal solutions does not help for TSP reoptimization
- New advances in reoptimizing the minimum Steiner tree problem
- New reoptimization techniques applied to Steiner tree problem
- On the Hardness of Reoptimization
- On the Hardness of Reoptimization with Multiple Given Solutions
- Reallocation problems in scheduling
- Reoptimization in machine scheduling
- Reoptimization of Minimum Latency problem
- Reoptimization of Steiner Trees
- Reoptimization of Steiner trees: changing the terminal set
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of maximum weight induced hereditary subgraph problems
- Reoptimization of minimum and maximum traveling salesman's tours
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Reoptimization of the metric deadline TSP
- Reoptimization of the shortest common superstring problem
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
- Reoptimizing the 0-1 knapsack problem
- Reoptimizing the rural postman problem
- Reoptimizing the traveling salesman problem
- Robust reoptimization of Steiner trees
- Scheduling with forbidden sets
- Simple and fast reoptimizations for the Steiner tree problem
- Steiner tree approximation via iterative randomized rounding
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- The Steiner tree problem on graphs: inapproximability results
- The steiner problem in graphs
- Thek-Steiner Ratio in Graphs
This page was built for publication: New algorithms for Steiner tree reoptimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586666)
