1. Repository of OAI
  2. ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"
  3. Σχολή Θετικών Επιστημών
  4. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
  5. Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)
Ελληνικά   English  
Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10878
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAfif, M.en
dc.contributor.authorLikas, A.en
dc.contributor.authorPaschos, V. T.en
dc.date.accessioned2015-11-24T17:01:09Z-
dc.date.available2015-11-24T17:01:09Z-
dc.identifier.issn0960-0779-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10878-
dc.rightsDefault Licence-
dc.titleA Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problemen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1995-
heal.abstractA 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
heal.journalNameChaos Solitons & Fractalsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Show simple item record
Files in This Item:
File Description SizeFormat 
Likas-1995-A Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problem.pdf534.66 kBAdobe PDFView/Open    Request a copy
Show simple item record  


This item is licensed under a Creative Commons License Creative Commons