Optimization of the Polynomial Greedy Solution for the Set Covering Problem

Spasovski, S. and Madevska-Bogdanova, Ana (2013) Optimization of the Polynomial Greedy Solution for the Set Covering Problem. In: Proceedings of the Tenth Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 175-177. ISBN 978-608-4699-01-9

[img]
Preview
Text
978-608-4699-01-9_pp175-177.pdf

Download (139kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

This paper proposes a modification of the known and widely used approximate greedy solution for the Set Cover Problem -- GREEDY SET COVER algorithm. Additionally the already known optimizations are presented and ability of their cohesion with the newly presented algorithm is confirmed. The proposed modification of the algorithm, OPTIMIZED SET COVER, in the best case, gives optimal results opposite to the GREEDY SET C OVER algorithm. In the worst case, it gives the same results as the GREEDY SET COVER solution without going out of the polynomial time boundary.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Theoretical Foundations of Informatics
International Conference on Informatics and Information Technologies > Signal Processing
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11262

Actions (login required)

View Item View Item