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

Thumbnail Image
Download
Name

AIM-2004-015.pdf

Size

611.37 KB

Format

Adobe PDF

Checksum (MD5)

e35b253ea245ec506c20005de860a011

Thumbnail Image
Download
Name

AIM-2004-015.ps

Size

958.45 KB

Format

PostScript

Checksum (MD5)

6afbeeaa77e3c526142fe63766001f3a

Author(s)
Badoiu, Mihai
•
Indyk, Piotr
•
Sidiropoulos, Anastasios
Date Issued
July 5, 2004
Series/Report no.
AIM-2004-015
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.
Subjects
AI
embeddings
approximation algorithms
trees
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.