Hardness of SetCover Reoptimization
- 7 June 2026
- book chapter
- Published by Springer Nature
- p. 370-384
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Appendix 2: Menger’s Theorems2013
- Reoptimization of set covering problemsCybernetics and Systems Analysis, 2010
- Reoptimization of Weighted Graph and Covering Problems2009
- On the Hardness of Reoptimization2008
- Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short CyclesAlgorithmica, 2008
- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs2006
- Parameterized Complexity of Independence and Domination on Geometric Graphs2006
- Parameterized Complexity Theory2006
- A Tight Analysis of the Greedy Algorithm for Set CoverJournal of Algorithms, 1997
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975