Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat.
David B. ShmoysGwen SpencerPublished in: Theory Comput. Syst. (2015)
Keyphrases
- open shop
- approximation algorithms
- undirected graph
- np hard
- special case
- constant factor
- disjoint paths
- minimum cost
- vertex cover
- worst case
- facility location problem
- set cover
- spanning tree
- approximation ratio
- network design problem
- primal dual
- random walk
- directed graph
- np hardness
- graph model
- directed acyclic graph
- randomized algorithms
- approximation schemes
- scheduling problem
- integer programming
- connected components