On greedy algorithms with weights for construction of partial covers

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/3-540-33521-8_42

Back

Conference proceeding

On greedy algorithms with weights for construction of partial covers

Mikhail Ju Moshkov, Marcin Piliszczuk and Beata Zielosko

INTELLIGENT INFORMATION PROCESSING AND WEB MINING, PROCEEDINGS, Vol.35, pp.391-395

ADVANCES IN SOFT COMPUTING

01/01/2006

DOI: https://doi.org/10.1007/3-540-33521-8_42

Abstract

Computer Science

Computer Science, Artificial Intelligence

Computer Science, Information Systems

Science & Technology

Technology

In the paper a modification of greedy algorithm with weights for construction of partial covers is considered. Theoretical and experimental results relating to accuracy of this algorithm are discussed.

Metrics

1 Record Views

Details

Title: On greedy algorithms with weights for construction of partial covers
Creators - without role: Mikhail Ju Moshkov - University of Silesia
Marcin Piliszczuk - ING Bank
Beata Zielosko - University of Silesia
Contributors - without role: M A Klopotek
S T Wierzchon
K Trojanowski
Publication Details: INTELLIGENT INFORMATION PROCESSING AND WEB MINING, PROCEEDINGS, Vol.35, pp.391-395
Series: ADVANCES IN SOFT COMPUTING
Publisher: Springer Nature
Number of pages: 2
Identifiers: 9945214208331
Academic Unit: King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding