A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
| dc.date.accessioned | 2005-12-22T01:35:27Z | |
| dc.date.accessioned | 2018-11-24T10:24:12Z | |
| dc.date.available | 2005-12-22T01:35:27Z | |
| dc.date.available | 2018-11-24T10:24:12Z | |
| dc.date.issued | 2004-07-05 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30484 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30484 | |
| dc.description.abstract | We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion. | |
| dc.format.extent | 8 p. | |
| dc.format.extent | 6685848 bytes | |
| dc.format.extent | 331083 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | |
| dc.subject | embeddings | |
| dc.subject | approximation algorithms | |
| dc.subject | trees | |
| dc.title | A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2004-045.pdf | 331.0Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2004-045.ps | 6.685Mb | application/postscript | View/ |