An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms Irene FinocchiAlessandro PanconesiRiccardo Silvestri OriginalPaper 15 September 2004 Pages: 1 - 23
Computing Diameter in the Streaming and Sliding-Window Models Joan FeigenbaumSampath KannanJian Zhang OriginalPaper 31 August 2004 Pages: 25 - 41
Approximation Algorithms for Quickest Spanning Tree Problems Refael HassinAsaf Levin OriginalPaper 21 September 2004 Pages: 43 - 52
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology Guoliang XueWei Xiao OriginalPaper 15 October 2004 Pages: 53 - 72