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

dc.creator	Badoiu, Mihai
dc.creator	Indyk, Piotr
dc.creator	Sidiropoulos, Anastasios
dc.date	2004-10-08T20:43:19Z
dc.date	2004-10-08T20:43:19Z
dc.date	2004-07-05
dc.date.accessioned	2013-10-09T02:46:44Z
dc.date.available	2013-10-09T02:46:44Z
dc.date.issued	2013-10-09
dc.identifier	AIM-2004-015
dc.identifier	http://hdl.handle.net/1721.1/6742
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.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.
dc.format	8 p.
dc.format	981451 bytes
dc.format	626039 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-2004-015
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
There are no files associated with this item.