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

 
see the original item page
in the repository's web site and access all digital files if the item*
share




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

Likas, A (EN)
Paschos, VTh (EN)
Afif, M (EN)

N/A (EN)

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)

journalArticle

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

Chaos, Solitons and Fractals (EN)

English

1995


PERGAMON-ELSEVIER SCIENCE LTD (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)