Pages that link to "Item:Q838156"
From MaRDI portal
The following pages link to Reoptimization of Steiner trees: changing the terminal set (Q838156):
Displaying 21 items.
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- New reoptimization techniques applied to Steiner tree problem (Q2840741) (← links)
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
- Simple and fast reoptimizations for the Steiner tree problem (Q2867366) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)
