Show simple item record

dc.contributor.authorAfif, Mohamed
dc.contributor.authorLikas, Aris
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2009-11-17T17:00:03Z
dc.date.available2009-11-17T17:00:03Z
dc.date.issued1995
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2463
dc.language.isoenen
dc.subjectAlgorithmesen
dc.subject.ddc003en
dc.titleA natural model and a parallel algorithm for approximately solving the maximum weighted independent set problemen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité d'Athènes;Grèce
dc.description.abstractenA dynamical model based upon a physical metaphor is described, and a parallel algorithm inspired from the model is developed for approximately solving maximum weight independent set problem. Our model treats an independent set as an attraction game, where vertices of the graph are considered as still bodies and edges as cells attracted by the still bodies corresponding to its extremities. In addition, we discuss how, by using an analogous model, an approximation algorithm can be developed for the minimum set covering problem.en
dc.relation.isversionofjnlnameChaos, Solitons and Fractals
dc.relation.isversionofjnlvol5en
dc.relation.isversionofjnlissue5en
dc.relation.isversionofjnldate1995
dc.relation.isversionofjnlpages739-746en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/0960-0779(94)00175-Pen
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record