Back to Search Start Over

Restricted parameter range promise set cover problems are easy.

Authors :
Chen, Hao
Source :
Frontiers of Mathematics in China; Dec2014, Vol. 9 Issue 6, p1253-1260, 8p
Publication Year :
2014

Abstract

The restricted parameter range set cover problem is a weak form of the NP-hard set cover problem with the restricted range of parameters. We give a polynomial time algorithm for this problem by lattices. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
POLYNOMIALS
ALGORITHMS
LATTICE theory
SET theory
MATHEMATICAL analysis

Details

Language :
English
ISSN :
16733452
Volume :
9
Issue :
6
Database :
Complementary Index
Journal :
Frontiers of Mathematics in China
Publication Type :
Academic Journal
Accession number :
98372279
Full Text :
https://doi.org/10.1007/s11464-014-0429-8
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details