We explore in this paper some complexity issues inspired by the contig scaffolding problem in bioinformatics. We focus on the following problem: given an undirected graph with no loop, and a perfect matching on this graph, find a set of cycles and paths covering every vertex of the graph, with edges alternatively in the matching and outside the matching, and satisfying a given constraint on the numbers of cycles and paths. We show that this problem is NP-complete, even in bipartite graphs. We also exhibit non-approximability and polynomial-time approximation results, in the optimization versions of the problem. © 2014 Springer International Publishing.
CITATION STYLE
Chateau, A., & Giroudeau, R. (2014). Complexity and polynomial-time approximation algorithms around the scaffolding problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8542 LNBI, pp. 47–58). Springer Verlag. https://doi.org/10.1007/978-3-319-07953-0_4
Mendeley helps you to discover research relevant for your work.