Sciweavers

334 search results - page 50 / 67
» Practical Parallel Algorithms for Minimum Spanning Trees
Sort
View
IPPS
2003
IEEE
15 years 2 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
14 years 10 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
TPDS
2010
155views more  TPDS 2010»
14 years 8 months ago
Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming
—In this paper we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divi...
Giuseppe Bianchi, Nicola Blefari-Melazzi, Lorenzo ...
PDIS
1996
IEEE
15 years 1 months ago
The Strobe Algorithms for Multi-Source Warehouse Consistency
A warehouse is a data repository containing integrated information for e cient querying and analysis. Maintaining the consistency of warehouse data is challenging, especially if t...
Yue Zhuge, Hector Garcia-Molina, Janet L. Wiener
NETWORKING
2007
14 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen