A 3-2/b(G)-approximation algorithm for the graph burning problem.
Jesús García DíazPublished in: CoRR (2020)
Keyphrases
- dynamic programming
- detection algorithm
- cost function
- learning algorithm
- computational complexity
- computational cost
- objective function
- optimization algorithm
- matching algorithm
- error bounds
- k means
- significant improvement
- graph structure
- probabilistic model
- preprocessing
- clustering method
- graph based algorithm
- recognition algorithm
- finding the shortest path
- optimal solution
- np hard
- search space
- lower bound
- segmentation algorithm
- weighted graph
- dominating set
- search algorithm
- maximum flow
- constant factor
- polygonal approximation
- graph clustering
- minimum spanning tree
- worst case
- linear programming
- particle swarm optimization
- theoretical analysis