Improved approximation algorithms for weighted 2-path partitions.
Amotz Bar-NoyDavid PelegGeorge RabancaIvo ViganPublished in: Discret. Appl. Math. (2018)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- special case
- worst case
- disjoint paths
- vertex cover
- network design problem
- facility location problem
- approximation ratio
- set cover
- approximation schemes
- exact algorithms
- np hardness
- constant factor
- randomized algorithms
- precedence constraints
- undirected graph
- open shop
- shortest path
- primal dual
- single machine
- constant factor approximation