Approximation Algorithms for Balancing Signed Graphs.
Zhuo DiaoZhongzheng TangPublished in: AAIM (2020)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- approximation guarantees
- np hardness
- graph matching
- facility location problem
- network design problem
- constant factor
- constant factor approximation
- primal dual
- precedence constraints
- set cover
- np complete
- randomized algorithms
- approximation schemes
- open shop
- disjoint paths
- approximation ratio
- graph model
- lower bound
- objective function