Practical Approximation Algorithms for Zero- and Bounded-Skew Trees

The skew of an edge-weighted rooted tree is the maximum difference between any two root-to-leaf path weights. Zero- or bounded-skew trees are needed for achieving synchronization in many applications, including network multicasting [G. N. Rouskas and I. Baldine, IEEE J. on Selected Areas in Communic...

Full description

Bibliographic Details

Published in:	SIAM journal on discrete mathematics Vol. 15; no. 1; pp. 97 - 111
Main Authors:	Zelikovsky, Alexander Z., Mandoiu, Ion I.
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2001
Subjects:	Algorithms Approximation Computer science Leaves R&D Research & development
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!