Approximation Algorithms and Lower Bounds for Graph Burning.
Matej LieskovskýJirí SgallAndreas Emil FeldmannPublished in: APPROX/RANDOM (2023)
Keyphrases
- approximation algorithms
- lower bound
- constant factor
- np hard
- undirected graph
- worst case
- min sum
- upper bound
- disjoint paths
- special case
- randomized algorithms
- minimum cost
- approximation ratio
- vertex cover
- graph structure
- set cover
- branch and bound algorithm
- approximation guarantees
- primal dual
- scheduling problem
- open shop
- np hardness
- strongly np hard
- integer programming
- objective function
- facility location problem
- exact algorithms
- approximation schemes
- lower and upper bounds
- precedence constraints
- random walk
- linear programming
- spanning tree
- branch and bound
- combinatorial auctions
- weighted graph
- integrality gap
- max flow
- sample complexity
- bipartite graph
- directed graph
- linear program
- search algorithm
- optimal solution