The following pages link to Andreas Sprock (Q414455):
Displaying 7 items.
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality (Q3563002) (← links)
- Advice Complexity of the Online Coloring Problem (Q4924664) (← links)
- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity (Q4925265) (← links)
