Reoptimization of set covering problems
From MaRDI portal
Publication:2247803
DOI10.1007/S10559-010-9269-ZzbMATH Open1291.68180OpenAlexW2015284280MaRDI QIDQ2247803FDOQ2247803
Authors: Victor A. Mikhailyuk 
Publication date: 30 June 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9269-z
Recommendations
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Reoptimization of Weighted Graph and Covering Problems
- An O(m n) algorithm for regular set-covering problems
- Online and dynamic algorithms for set cover
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)
Cites Work
Cited In (8)
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- Title not available (Why is that?)
- Parameterized dynamic variants of red-blue dominating set
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of NP-Hard Problems
- Reoptimization of constraint satisfaction problems with approximation resistant predicates
This page was built for publication: Reoptimization of set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247803)
