A 2+epsilon approximation algorithm for the k-MST problem
| dc.contributor.author | Arora, S. | en |
| dc.contributor.author | Karakostas, G. | en |
| dc.date.accessioned | 2015-11-24T17:26:23Z | |
| dc.date.available | 2015-11-24T17:26:23Z | |
| dc.identifier.issn | 0025-5610 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13194 | |
| dc.rights | Default Licence | - |
| dc.subject | k-minimum spanning tree | en |
| dc.subject | approximation algorithm | en |
| dc.subject | primal-dual schema | en |
| dc.subject | trees | en |
| dc.title | A 2+epsilon approximation algorithm for the k-MST problem | en |
| heal.abstract | For any epsilon > 0 we give a (2 + epsilon)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [10]. As in [10] the algorithm extends to a (2 + epsilon)-approximation algorithm for the minimum tour that visits any k vertices, provided the edge costs satisfy the triangle inequality. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | DOI 10.1007/s10107-005-0693-1 | - |
| heal.identifier.secondary | <Go to ISI>://000236418400008 | - |
| heal.identifier.secondary | http://download.springer.com/static/pdf/845/art%253A10.1007%252Fs10107-005-0693-1.pdf?auth66=1390991909_7814733229273a02cc2fd8c0bbcafb6d&ext=.pdf | - |
| heal.journalName | Mathematical Programming | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2006 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: