Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.
Elliot AnshelevichDeeparnab ChakrabartyAmeya HateChaitanya SwamyPublished in: ISAAC (2009)
Keyphrases
- approximation algorithms
- polynomial time approximation
- np hard
- special case
- vertex cover
- facility location problem
- minimum cost
- approximation schemes
- open shop
- network design problem
- exact algorithms
- primal dual
- worst case
- precedence constraints
- set cover
- approximation ratio
- constant factor approximation
- np hardness
- randomized algorithms
- scheduling problem
- disjoint paths
- optimal solution
- constant factor
- combinatorial auctions
- optimization problems