Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem.
Sylvia C. BoydPhilippe LegaultPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- minimum cost
- np hard
- undirected graph
- lower bound
- worst case
- approximation algorithms
- network flow
- upper bound
- spanning tree
- network flow problem
- np complete
- minimum cost flow
- capacity constraints
- scheduling problem
- network simplex algorithm
- optimal solution
- connected components
- linear programming
- graph mining
- special case
- edge weights
- multi objective
- integer programming
- edge detection