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...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on discrete mathematics Ročník 15; číslo 1; s. 97 - 111
Hlavní autori:	Zelikovsky, Alexander Z., Mandoiu, Ion I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2001
Predmet:	Algorithms Approximation Computer science Leaves R&D Research & development
ISSN:	0895-4801, 1095-7146
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!