Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem.
Peng ZhangBin FuLinqing TangPublished in: Algorithmica (2018)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- undirected graph
- np hard
- special case
- worst case
- integrality gap
- vertex cover
- np hardness
- facility location problem
- randomized algorithms
- set cover
- network design problem
- approximation schemes
- open shop
- network flow
- precedence constraints
- disjoint paths
- constant factor approximation
- min cut
- approximation ratio
- spanning tree
- lower bound
- planar graphs
- primal dual
- combinatorial auctions
- error bounds
- linear programming
- computational complexity