Pages that link to "Item:Q414457"
From MaRDI portal
The following pages link to Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457):
Displayed 6 items.
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- (Q5002685) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)