In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first node layer of the graph, with the constraint that all paths have both endpoints in the second node layer and no node in that layer is covered more than once. MS is equivalent to the node-duplication based crossing elimination problem (NDCE) that arises in the design of molecular quantum-dot cellular automata (QCA) circuits and the physical synthesis of BDD based regular circuit structures in VLSI design. We show that MS is NP-hard, present a polynomial-time 1.5-approximation algorithm, and show that MS cannot be approximated with a factor better than 740/439 unless P = NP. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Chaudhary, A., Chen, D. Z., Fleischer, R., Hu, X. S., Li, J., Niemier, M. T., … Zhu, H. (2007). Approximating the maximum sharing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 52–63). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_6
Mendeley helps you to discover research relevant for your work.