Hardness results, approximation and exact algorithms for liar's domination problem in graphs.
Bhawani Sankar PandaSubhabrata PaulDinabandhu PradhanPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- exact algorithms
- approximation algorithms
- np hard
- worst case
- knapsack problem
- benchmark instances
- exact solution
- special case
- benders decomposition
- vehicle routing problem with time windows
- computational problems
- combinatorial optimization
- combinatorial optimization problems
- nonlinear programming
- combinatorial problems
- max sat
- graph matching
- heuristic methods
- network design problem
- phase transition
- upper bound
- scheduling problem
- tabu search
- graph mining
- exact methods
- lower bound