On the Exact Block Cover Problem

DOI10.1007/978-3-319-07956-1_2zbMath1445.68111OpenAlexW25590236MaRDI QIDQ5251630

Haitao Jiang, Binhai Zhu, Bing Su, Mingyu Xiao, Farong Zhong, Yin-Feng Xu

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

Computing equality-free and repetitive string factorisations ⋮ Computing Equality-Free String Factorisations ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ Fixed-parameter tractability for the Tree Assembly problem ⋮ Characterization and complexity results on jumping finite automata

This page was built for publication: On the Exact Block Cover Problem