Skip to main content
Conference Proceedings

On construction of the set of irreducible partial covers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3777 LNCS 38-44
DOI: 10.1007/11571155_4
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper a totally polynomial algorithm for construction of the set of irreducible partial covers for the major part of set cover problems is considered. © Springer-Verlag Berlin Heidelberg 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Moshkov, M. J. (2005). On construction of the set of irreducible partial covers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3777 LNCS, pp. 38–44). https://doi.org/10.1007/11571155_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free