Approximation Algorithms for Partially Colorable Graphs.
Suprovat GhoshalAnand LouisRahul RaychaudhuryPublished in: APPROX-RANDOM (2019)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- network design problem
- randomized algorithms
- spanning tree
- primal dual
- open shop
- approximation ratio
- approximation guarantees
- np hardness
- graph matching
- set cover
- approximation schemes
- combinatorial auctions
- lower bound
- weighted graph
- facility location problem
- constant factor
- partial order
- strongly np hard
- directed graph
- upper bound
- disjoint paths