Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms.
Matthew FredriksonMihai ChristodorescuSomesh JhaPublished in: CADE (2011)
Keyphrases
- approximation algorithms
- complexity analysis
- dynamic behavior
- np hard
- special case
- theoretical analysis
- vertex cover
- lower bound
- worst case
- minimum cost
- facility location problem
- primal dual
- set cover
- approximation ratio
- computational complexity
- open shop
- constant factor approximation
- network design problem
- first order logic
- np hardness
- precedence constraints
- combinatorial auctions
- constant factor
- disjoint paths
- approximation schemes
- multi agent systems
- machine learning