A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
| dc.date.accessioned | 2004-10-08T20:43:19Z | |
| dc.date.accessioned | 2018-11-24T10:21:44Z | |
| dc.date.available | 2004-10-08T20:43:19Z | |
| dc.date.available | 2018-11-24T10:21:44Z | |
| dc.date.issued | 2004-07-05 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6742 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6742 | |
| dc.description.abstract | We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion. | en_US |
| dc.format.extent | 8 p. | en_US |
| dc.format.extent | 981451 bytes | |
| dc.format.extent | 626039 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | en_US |
| dc.subject | embeddings | en_US |
| dc.subject | approximation algorithms | en_US |
| dc.subject | trees | en_US |
| dc.title | A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-2004-015.pdf | 626.0Kb | application/pdf | View/ |
| AIM-2004-015.ps | 981.4Kb | application/postscript | View/ |