On the approximability and exact algorithms for vector domination and related problems in graphs.
Ferdinando CicaleseMartin MilanicUgo VaccaroPublished in: Discret. Appl. Math. (2013)
Keyphrases
- related problems
- exact algorithms
- approximation algorithms
- knapsack problem
- benchmark instances
- vehicle routing problem with time windows
- exact solution
- heuristic methods
- np hard
- combinatorial problems
- max sat
- benders decomposition
- combinatorial optimization problems
- computational problems
- broadly applicable
- special case
- combinatorial optimization
- range searching
- worst case
- stable marriage
- vector space
- dynamic programming
- structured databases