Abstract
In this paper, we study the set cover problems, the minimum cardinality key problems and the optimal screen problems. We consider SET COVER-II, a variant of SET COVER, i.e., finding L sets among given n sets such that the cardinality of their union maximizes. We give both a lower bound and an upper bound to the approximation ratio of SET COVER-II and obtain a new result on SET COVER by approaching it from SET COVER-II. The minimum cardinality key problems and the optimal screen problems are more practical where the latter ones are problems of seeking a good subset from a given set of substructures and are originated from database management systems for chemical structures. We analyze the approximation ratios of those problems by reductions from/to set cover problems and give average case analyses.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, S.: Graphical representation of molecules and substructure-search queries in MACCS. J. Molecular Graphics 2 (1984) 83–89
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation algorithms. Proc. FOCS'92 (1992) 14–23
Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31 (1984) 30–46
Crescenzi, P., Kann, V.: A compendium of NP optimization problems. Manuscript (1995)
Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Halldórsson, M. M.: Approximating discrete collections via local improvement. Proc. SODA'95 (1995)
Jiang, T., Li, M.: On the approximation of shortest common super sequences and longest common subsequences. Proc. ICALP'94, LNCS, Springer-Verlag (1994) 191–202
Johnson, D. S.: Approximation algorithms for combinatorial problems. JCSS 9 (1974) 256–278
Kann, V.: Polynomially bounded minimization problems which are hard to approximate. Proc. ICALP'93, LNCS, Springer-Verlag (1993) 52–63
Kolaitis, P. G., Thakur, M. N.: Logical definability of NP optimization problems. Information and Computation 115 (1994) 321–353
Lovász, L.: On the ratio of optimal integral and fractional covers. Disc. Math. 13 (1975) 383–390
Lucchesi, C. L., Osborn, S. L.: Candidate keys for relations. JCSS 17 (1978) 270–279
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41 (1994) 960–981
Papadimitriou, C. H., Yannakakis, M.: Optimization, approximation, and complexity classes. JCSS 43 (1991) 425–440
Randic, M., Wilkins, C. L.: Graph-based fragment searches in polycyclic structures. J. Chemical Information and Computer Sciences 19 (1979) 23–31
Stobaugh, R. E.: Chemical substructure searching. J. Chemical Information and Computer Sciences 25 (1985) 271–275
Sussenguth, Jr. E. H.: A graph-theoretic algorithm for matching chemical structures. J. Chemical Documentation 5 (1965) 36–43
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akutsu, T., Bao, F. (1996). Approximating minimum keys and optimal substructure screens. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_163
Download citation
DOI: https://doi.org/10.1007/3-540-61332-3_163
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61332-9
Online ISBN: 978-3-540-68461-9
eBook Packages: Springer Book Archive