In the maximum simple sharing problem (MSS), we want to compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the graph, with the constraint that all paths have both endpoints in the other layer. This is a variation of the maximum sharing problem (MS) that finds important applications in the design of molecular quantum-dot cellular automata (QCA) circuits and physical synthesis in VLSI. It also generalizes the maximum weight node-disjoint path cover problem. We show that MSS is NP-complete, present a polynomial-time -approximation algorithm, and show that it cannot be approximated with a factor better than unless P = NP. © 2006 Springer-Verlag Berlin/Heidelberg.
CITATION STYLE
Chen, D. Z., Fleischer, R., Li, J., Xie, Z., & Zhu, H. (2006). On approximating the maximum simple sharing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 547–556). https://doi.org/10.1007/11940128_55
Mendeley helps you to discover research relevant for your work.