Approximation Algorithms for the Graph Burning on Cactus and Directed Trees.
Rahul Kumar GautamAnjeneya Swami KareS. Durga BhavaniPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- np hard
- disjoint paths
- worst case
- vertex cover
- special case
- facility location problem
- minimum cost
- network design problem
- randomized algorithms
- random walk
- directed graph
- approximation ratio
- open shop
- set cover
- bounded degree
- np hardness
- primal dual
- graph matching
- precedence constraints
- graph model
- directed acyclic graph
- weighted graph
- graph structure
- planar graphs
- bipartite graph
- polynomial time approximation
- approximation schemes
- connected components
- tree structure
- objective function
- minimum spanning tree