Computing the differential of a graph: Hardness, approximability and exact algorithms.
Sergio BermudoHenning FernauPublished in: Discret. Appl. Math. (2014)
Keyphrases
- exact algorithms
- approximation algorithms
- np hard
- knapsack problem
- benchmark instances
- exact solution
- vehicle routing problem with time windows
- benders decomposition
- graph structure
- worst case
- combinatorial optimization
- special case
- heuristic methods
- combinatorial optimization problems
- combinatorial problems
- graph model
- computational complexity
- graph matching
- computational problems
- graph databases
- information retrieval
- max sat
- phase transition
- np complete