Approximation Algorithm and Hardness Results for Defensive Domination in Graphs.
Michael A. HenningArti PandeyVikash TripathiPublished in: COCOA (2021)
Keyphrases
- np hard
- dynamic programming
- computational complexity
- learning algorithm
- closed form
- detection algorithm
- cost function
- high accuracy
- minimum spanning tree
- randomly generated
- approximation algorithms
- worst case
- preprocessing
- optimal solution
- theoretical analysis
- graph structure
- bayesian networks
- special case
- segmentation algorithm
- optimization algorithm
- significant improvement
- k means
- graph theory
- graph model