Showing cs.CCShow all
2 papers · 1 filter
cs.CC2019
Finding Optimal Solutions With Neighborly Help
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra +2
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficientl…
cs.CC2018
Reoptimization of Parameterized Problems
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk +1
Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or ap…