Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10978Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Likas, A. | en |
| dc.contributor.author | Stafylopatis, A. | en |
| dc.date.accessioned | 2015-11-24T17:01:47Z | - |
| dc.date.available | 2015-11-24T17:01:47Z | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10978 | - |
| dc.rights | Default Licence | - |
| dc.subject | heuristics | en |
| dc.subject | optimization | en |
| dc.subject | parallel algorithms | en |
| dc.subject | vertex covering | en |
| dc.subject | approximation | en |
| dc.title | A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 1995 | - |
| heal.abstract | An original parallel algorithm is presented that stems from a suitable physical metaphor by considering each edge of the graph as a cell that is attracted by the corresponding vertices and finally moves towards the one of them that wins the competition. | en |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Likas-1995-A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem.pdf | 522.45 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
