On the exact block cover problem

DOI10.1007/978-3-319-07956-1_2MaRDI QIDQ5251630zbMATH OpenOpenAlexFDO

Authors Haitao Jiang, Bing Su, Mingyu Xiao, Farong Zhong, Binhai Zhu, Yinfeng 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

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

Recommendations

• Exponential and polynomial time algorithms for the minimum common string partition problem
• Minimum common string partition revisited
• Minimum common string partition revisited
• Minimum common string partition problem: hardness and approximations
• Algorithms and Computation

Cited in

(10)

• On bounds for a board covering problem
• Fixed-parameter tractability for the tree assembly problem
• Characterization and complexity results on jumping finite automata
• Computing equality-free and repetitive string factorisations
• Jumping finite automata: characterizations and complexity
• scientific article; zbMATH DE number 5990470 (Why is no real title available?)
• Computing equality-free string factorisations
• On the number of covering blocks
• Parameterized algorithms for the spanning forest isomorphism and containment on tree
• Parameterized algorithms for the spanning forest isomorphism (or containment) on tree problems

This page was built for publication: On the exact block cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251630)