Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat.
David B. ShmoysGwen SpencerPublished in: WAOA (2011)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- special case
- np hard
- disjoint paths
- vertex cover
- worst case
- facility location problem
- minimum cost
- network design problem
- random walk
- primal dual
- spanning tree
- approximation ratio
- planar graphs
- randomized algorithms
- open shop
- constant factor approximation
- set cover
- np hardness
- precedence constraints
- graph structure
- approximation schemes
- bipartite graph
- directed graph
- lower bound
- graph model
- weighted graph
- polynomial time approximation
- computational complexity