Show simple item record

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees

dc.date.accessioned2004-10-08T20:43:19Z
dc.date.accessioned2018-11-24T10:21:44Z
dc.date.available2004-10-08T20:43:19Z
dc.date.available2018-11-24T10:21:44Z
dc.date.issued2004-07-05en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6742
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6742
dc.description.abstractWe 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.extent8 p.en_US
dc.format.extent981451 bytes
dc.format.extent626039 bytes
dc.language.isoen_US
dc.subjectAIen_US
dc.subjectembeddingsen_US
dc.subjectapproximation algorithmsen_US
dc.subjecttreesen_US
dc.titleA Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Treesen_US


Files in this item

FilesSizeFormatView
AIM-2004-015.pdf626.0Kbapplication/pdfView/Open
AIM-2004-015.ps981.4Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record