78 search results - page 16 / 16 » Differential Approximation for Some Routing Problems |
SPAA
2006
ACM
13 years 11 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...