Hardness results and approximation algorithm for total liar's domination in graphs.
B. S. PandaSubhabrata PaulPublished in: J. Comb. Optim. (2014)
Keyphrases
- computational complexity
- worst case
- dynamic programming
- experimental evaluation
- approximation ratio
- recognition algorithm
- optimization algorithm
- significant improvement
- objective function
- graph structure
- detection algorithm
- theoretical analysis
- computational cost
- special case
- preprocessing
- learning algorithm
- np hard
- simulated annealing
- expectation maximization
- k means
- optimal solution
- graph model
- search space
- association rules
- polynomial time approximation