A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We investigate the computational complexity of a general "compression task" centrally occurring in the recently developed technique of iterative compression for exactly solving NP-hard minimization problems. The core issue (particularly but not only motivated by iterative compression) is to determine the computational complexity of, given an already inclusion-minimal solution for an underlying (typically NPhard) vertex deletion problem in graphs, to find a better disjoint solution. Thedoi:10.1007/978-3-642-03816-7_28 fatcat:3gifzkyfkbaw3gvaedx5cynmda