A 42k Kernel for the Complementary Maximal Strip Recovery Problem

DOI10.1007/978-3-319-59605-1_16zbMath1429.68339OpenAlexW2732677793MaRDI QIDQ4632213

Jianxin Wang, Haiyan Liu, Wenjun Li, Lingyun Xiang, Yongjie Yang

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_16

Mathematics Subject Classification ID

Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem ⋮ An improved linear kernel for complementary maximal strip recovery: simpler and smaller

Cites Work

• Unnamed Item
• Planar graph vertex partition for linear problem kernels
• 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 recovering syntenic blocks from comparative maps
• Towards optimal kernel for connected vertex cover in planar graphs
• Maximal strip recovery problem with gaps: hardness and approximation algorithms
• Towards optimal kernel for edge-disjoint triangle packing
• A linear kernel for the complementary maximal strip recovery problem
• An Improved Kernel for the Complementary Maximal Strip Recovery Problem

This page was built for publication: A 42k Kernel for the Complementary Maximal Strip Recovery Problem