Maximal strip recovery problem with gaps: hardness and approximation algorithms
DOI10.1007/978-3-642-10631-6_72zbMATH Open1273.68406OpenAlexW1490767057MaRDI QIDQ3652257FDOQ3652257
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_72
Recommendations
Genetics and epigenetics (92D10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (10)
- A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
- Exact and approximation algorithms for the complementary maximal strip recovery problem
- An improved approximation algorithm for the complementary maximal strip recovery problem
- Tractability and approximability of maximal strip recovery
- Inapproximability of maximal strip recovery
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- Maximal strip recovery problem with gaps: hardness and approximation algorithms
- A linear kernel for the complementary maximal strip recovery problem
- Tractability and Approximability of Maximal Strip Recovery
This page was built for publication: Maximal strip recovery problem with gaps: hardness and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652257)
