Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12432Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Karakostas, G. | en |
| dc.date.accessioned | 2015-11-24T17:21:11Z | - |
| dc.date.available | 2015-11-24T17:21:11Z | - |
| dc.identifier.issn | 1549-6325 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12432 | - |
| dc.rights | Default Licence | - |
| dc.subject | approximation algorithm | en |
| dc.subject | vertex cover | en |
| dc.subject | semidefinite programming | en |
| dc.subject | graphs | en |
| dc.title | A Better Approximation Ratio for the Vertex Cover Problem | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1145/1597036.1597045 | - |
| heal.identifier.secondary | <Go to ISI>://000271945600008 | - |
| heal.identifier.secondary | http://delivery.acm.org/10.1145/1600000/1597045/a41-karakostas.pdf?ip=195.251.197.109&id=1597045&acc=ACTIVE%20SERVICE&key=C2716FEBFA981EF1E9B06A0954DB6E6FB2E80188D446F61C&CFID=286340637&CFTOKEN=12197681&__acm__=1390819479_10d4643de099cac72ff498e88005f001 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2009 | - |
| heal.abstract | We reduce the approximation factor for the vertex cover to 2 - Theta(1/root log n) (instead of the previous 2 - Theta lnlnn/2lnn obtained by Bar-Yehuda and Even [1985] and Monien and Speckenmeyer [1985]). The improvement of the vanishing factor comes as an application of the recent results of Arora et al. [2004] that improved the approximation factor of the sparsest cut and balanced cut problems. In particular, we use the existence of two big and well-separated sets of nodes in the solution of the semidefinite relaxation for balanced cut, proven by Arora et al. [2004]. We observe that a solution of the semidefinite relaxation for vertex cover, when strengthened with the triangle inequalities, can be transformed into a solution of a balanced cut problem, and therefore the existence of big well-separated sets in the sense of Arora et al. [2004] translates into the existence of a big independent set. | en |
| heal.journalName | Acm Transactions on Algorithms | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Karakostas-2009-A Better Approximati.pdf | 88.33 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
