On construction of the set of irreducible partial covers

Mikhail Ju Moshkov

doi:10.1007/11571155_4

On construction of the set of irreducible partial covers

Mikhail Ju Moshkov^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English (US)
Title of host publication	Stochastic Algorithms
Subtitle of host publication	Foundations and Applications - Third International Symposium, SAGA 2005, Proceedings
Pages	38-44
Number of pages	7
DOIs	https://doi.org/10.1007/11571155_4
State	Published - 2005
Externally published	Yes
Event	3rd International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005 - Moscow, Russian Federation Duration: Oct 20 2005 → Oct 22 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3777 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005
Country/Territory	Russian Federation
City	Moscow
Period	10/20/05 → 10/22/05

Keywords

Irreducible partial cover
Totally polynomial algorithm

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11571155_4

Cite this

Moshkov, M. J. (2005). On construction of the set of irreducible partial covers. In Stochastic Algorithms: Foundations and Applications - Third International Symposium, SAGA 2005, Proceedings (pp. 38-44). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3777 LNCS). https://doi.org/10.1007/11571155_4

@inproceedings{6997d823c8e84e4ab5080d5987d3cc3c,

title = "On construction of the set of irreducible partial covers",

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.",

keywords = "Irreducible partial cover, Totally polynomial algorithm",

author = "Moshkov, {Mikhail Ju}",

year = "2005",

doi = "10.1007/11571155_4",

language = "English (US)",

isbn = "3540294988",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "38--44",

booktitle = "Stochastic Algorithms",

note = "3rd International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005 ; Conference date: 20-10-2005 Through 22-10-2005",

}

Moshkov, MJ 2005, On construction of the set of irreducible partial covers. in Stochastic Algorithms: Foundations and Applications - Third International Symposium, SAGA 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3777 LNCS, pp. 38-44, 3rd International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005, Moscow, Russian Federation, 10/20/05. https://doi.org/10.1007/11571155_4

On construction of the set of irreducible partial covers. / Moshkov, Mikhail Ju.
Stochastic Algorithms: Foundations and Applications - Third International Symposium, SAGA 2005, Proceedings. 2005. p. 38-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3777 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On construction of the set of irreducible partial covers

AU - Moshkov, Mikhail Ju

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Irreducible partial cover

KW - Totally polynomial algorithm

UR - http://www.scopus.com/inward/record.url?scp=33646734699&partnerID=8YFLogxK

U2 - 10.1007/11571155_4

DO - 10.1007/11571155_4

M3 - Conference contribution

AN - SCOPUS:33646734699

SN - 3540294988

SN - 9783540294986

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 38

EP - 44

BT - Stochastic Algorithms

T2 - 3rd International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005

Y2 - 20 October 2005 through 22 October 2005

ER -

On construction of the set of irreducible partial covers

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this