Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs.
Diptendu ChatterjeeRishiraj BhattacharyyaPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- dynamic programming
- computational complexity
- objective function
- np hard
- error bounds
- preprocessing
- square error
- probabilistic model
- k means
- lower bound
- dominating set
- worst case
- expectation maximization
- minimum spanning tree
- spanning tree
- closed form
- neural network
- constant factor
- approximation ratio
- polygonal approximation
- graph clustering
- undirected graph
- weighted graph
- decision trees
- matching algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- image segmentation
- computational cost
- similarity measure
- optimal solution
- special case