Approximation Algorithms for Partially Colorable Graphs.
Suprovat GhoshalAnand LouisRahul RaychaudhuryPublished in: CoRR (2019)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- open shop
- approximation guarantees
- network design problem
- primal dual
- precedence constraints
- graph matching
- randomized algorithms
- np hardness
- constant factor
- directed graph
- spanning tree
- combinatorial auctions
- computational complexity
- network flow
- graph model
- approximation ratio
- weighted graph
- approximation schemes
- error bounds
- disjoint paths