Pages that link to "Item:Q3637106"
From MaRDI portal
The following pages link to Reoptimization of the Shortest Common Superstring Problem (Q3637106):
Displaying 11 items.
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- New reoptimization techniques applied to Steiner tree problem (Q2840741) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- (Q3409986) (← links)
- Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256) (← links)
- Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487) (← links)