Sciweavers

117 search results - page 20 / 24
» Minimizing the Diameter of a Network Using Shortcut Edges
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
DSN
2004
IEEE
13 years 11 months ago
Dynamic Quarantine of Internet Worms
If we limit the contact rate of worm traffic, can we alleviate and ultimately contain Internet worms? This paper sets out to answer this question. Specifically, we are interested ...
Cynthia Wong, Chenxi Wang, Dawn Xiaodong Song, Sta...
CONEXT
2009
ACM
13 years 8 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 29 days ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...