A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem

Afif, M; Likas, A; Paschos, VTh

dc.contributor.author	Afif, M	en
dc.contributor.author	Likas, A	en
dc.contributor.author	Paschos, VTh	en
dc.date.accessioned	2014-03-01T01:10:40Z
dc.date.available	2014-03-01T01:10:40Z
dc.date.issued	1995	en
dc.identifier.issn	0960-0779	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11422
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-58149320710&partnerID=40&md5=d2490ede8d21e8ad3ec44a13f81fde83	en
dc.subject.classification	Mathematics, Interdisciplinary Applications	en
dc.subject.classification	Physics, Multidisciplinary	en
dc.subject.classification	Physics, Mathematical	en
dc.title	A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	A 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. © 1995.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Chaos, Solitons and Fractals	en
dc.identifier.isi	ISI:A1995RA70700002	en
dc.identifier.volume	5	en
dc.identifier.issue	5	en
dc.identifier.spage	739	en
dc.identifier.epage	746	en