On the Hardness of Reoptimization with Multiple Given Solutions

DOI10.3233/FI-2011-528zbMath1254.90185OpenAlexW2131550992MaRDI QIDQ3100925

Andreas Sprock, Juraj Hromkovič, Hans-Joachim Böckenhauer

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-528

zbMATH Keywords

TSPSteiner treehardnessreoptimizationmultiple given solution

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Unnamed Item ⋮ Reoptimization in machine scheduling

This page was built for publication: On the Hardness of Reoptimization with Multiple Given Solutions