Georgia State University / University of Connecticut / University of Bonn / Georgia Institute of Technology / Massachusetts Institute of Technology / University of California / /
Georgia State University / Atlanta / Department of Computer Science / University of Connecticut / Massachusetts Institute of Technology / Boston / Georgia Institute of Technology / Atlanta / Electrical and Computer Engineering Department / Department of Electrical Engineering and Computer Science / University of Bonn / Department of Computer Science and Engineering / Computer Science Department / University of California at San Diego / / /
ProvinceOrState
California / Georgia / Massachusetts / Connecticut / /
PublishedMedium
Lecture Notes in Computer Science / /
Technology
heuristic algorithm / above algorithms / constant-factor approximation algorithm / QoSMT algorithm / QoSMT approximation algorithm / β-convex Steiner tree approximation algorithms / two Steiner tree algorithms / 5 Approximation Algorithm / Approximation algorithm / time algorithm / loss-contracting algorithm / β-convex algorithm / using β-convex αapproximation Steiner tree algorithm / Steiner tree algorithm / 3 Steiner Tree Algorithm / Steiner tree algorithms / Approximation Algorithms / Steiner tree approximation algorithms / 4 QoSMT Approximation Algorithm / remaining rate r1 points using algorithm / Quality of Service / β-convex α-approximation Steiner tree algorithm / generic approximation algorithm / Improved Approximation Algorithms / /
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem? Marek Karpinski1, Ion I. M˘ andoiu2 , Alexander Olshevsky3, and Alexander Zelikovsky4 1