On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
New advances in reoptimizing the minimum steiner tree problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Reoptimizing the rural postman problem
Computers and Operations Research
| Hi-index | 0.00 |
If an element is inserted into or removed from a set, then the set covering problem can be reoptimized with some ratio $ \left( {2 - \frac{1}{{\ln m + 1}}} \right) $ , where m is the number of elements of the set. A similar result holds if an arbitrary number 1 p m of elements of the set is inserted or removed.