The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I' resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I', either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are max independent set, max κ-colorable subgraph and max split subgraph under vertex insertions and deletions. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Boria, N., Monnot, J., & Paschos, V. T. (2012). Reoptimization of some maximum weight induced hereditary subgraph problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 73–84). https://doi.org/10.1007/978-3-642-29344-3_7
Mendeley helps you to discover research relevant for your work.