Reoptimization of the maximum weighted Pk-free subgraph problem under vertex insertion

Authors:
Nicolas Boria;Jérôme Monnot;Vangelis Th. Paschos
Affiliations:
LAMSADE, CNRS UMR 7243 and Université Paris-Dauphine, France;LAMSADE, CNRS UMR 7243 and Université Paris-Dauphine, France;LAMSADE, CNRS UMR 7243 and Université Paris-Dauphine, France
Venue:
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Year:
2012

Citing 11
Cited 0

The Approximation of Maximum Subgraph Problems

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Reoptimization of Steiner Trees

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Reoptimization of the Shortest Common Superstring Problem

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Reoptimization of Steiner trees: Changing the terminal set

Theoretical Computer Science
Reoptimization of the metric deadline TSP

Journal of Discrete Algorithms
On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Fast reoptimization for the minimum spanning tree problem

Journal of Discrete Algorithms
Reoptimizing the 0-1 knapsack problem

Discrete Applied Mathematics
Knowing all optimal solutions does not help for TSP reoptimization

Computation, cooperation, and life
Reoptimization of minimum and maximum traveling salesman's tours

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. In this setting we study the weighted version of max weightedPk-free subgraph. We then show, how the technique we use allows us to handle also bin packing.