Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6742| Title: | A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees |
| Keywords: | AI embeddings approximation algorithms trees |
| Issue Date: | 9-Oct-2013 |
| Description: | 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. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | AIM-2004-015 http://hdl.handle.net/1721.1/6742 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.