An experimental comparison of greedy heuristics for the minimum weight dominating set problem

Simple item page
dc.contributor.authorBaalla, Amira
dc.date.accessioned2018-02-28T09:48:50Z
dc.date.available2018-02-28T09:48:50Z
dc.date.issued2015
dc.description.abstractIn this study, we deal with one of the fundamental problems in graph theory and combinatorial optimization, that is, the minimum weight dominating set problem (MWDS). We make a comparison between well-known greedy heuristics for the MWDS problem and we add two new modified greedy heuristics. Experimental results show that the latters are more effective and perform better that the other greedy heuristics.en_US
dc.identifier.urihttp://dspace.univ-msila.dz:8080//xmlui/handle/123456789/3278
dc.language.isoenen_US
dc.publisherFaculty of Mathematics and Informatics-UNIVERSITY OF M’SILAen_US
dc.titleAn experimental comparison of greedy heuristics for the minimum weight dominating set problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Baalla Amira.rar
Size:
4.86 MB
Format:
Unknown data format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Master Thesis