Fast reoptimization for the minimum spanning tree problem
From MaRDI portal
Publication:988691
DOI10.1016/j.jda.2009.07.002zbMath1192.90218OpenAlexW2059166716MaRDI QIDQ988691
Nicolas Boria, Vangelis Th. Paschos
Publication date: 18 August 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.07.002
Related Items (8)
A survey on combinatorial optimization in dynamic environments ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Robust reoptimization of Steiner trees ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ Unnamed Item ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ REOPTIMIZATION UNDER VERTEX INSERTION: MAX Pk-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- A data structure for dynamic trees
- Reoptimization of Steiner Trees
- Reoptimization of Weighted Graph and Covering Problems
- Efficiency of a Good But Not Linear Set Union Algorithm
- Finding Minimum Spanning Trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Reoptimizing the traveling salesman problem
- Maintaining minimum spanning trees in dynamic graphs
- On the Hardness of Reoptimization
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Scheduling with forbidden sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast reoptimization for the minimum spanning tree problem
