New Approximation Algorithms for Minimum Weighted Edge Cover.
S. M. FerdousAlex PothenArif KhanPublished in: CSC (2018)
Keyphrases
- approximation algorithms
- disjoint paths
- minimum cost
- constant factor
- undirected graph
- np hard
- special case
- weighted graph
- worst case
- set cover
- vertex cover
- spanning tree
- primal dual
- facility location problem
- network design problem
- open shop
- randomized algorithms
- exact algorithms
- edge weights
- np hardness
- precedence constraints
- approximation ratio
- network flow
- approximation schemes
- weighted sum
- edge detection
- objective function
- approximation guarantees
- linear programming
- constant factor approximation