Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Indexing and ranking are two key factors for efficient and effective XML information retrieval. Inappropriate indexing may result in false negatives and false positives, and impro...
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...