A data structure for dynamic trees
Journal of Computer and System Sciences
Scheduling with forbidden sets
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Approximating Maximum Clique by Removing Subgraphs
SIAM Journal on Discrete Mathematics
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
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 Traveling Salesperson Problems: Changing Single Edge-Weights
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the Hardness of Reoptimization with Multiple Given Solutions
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 5.23 |
The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem @P, an optimal solution OPT for @P in I and an instance I^' resulting from a local modification of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve @P in I^'. The aim is to achieve either a better approximation ratio or a better running time (or both) than guaranteed by ex nihilo 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, maxk-colorable subgraph and max split subgraph under vertex insertions and deletions.