20 search results - page 1 / 4 » Existence Theorems and Approximation Algorithms for Generali... |
104
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
124
Voted
ATAL
2011
Springer
14 years 2 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
104
click to vote
SIAMDM
2008
15 years 2 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
135
click to vote
WAOA
2010
Springer
15 years 6 days ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
130
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...