Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph.
Sylvia C. BoydPhilippe LegaultPublished in: SIAM J. Discret. Math. (2017)
Keyphrases
- minimum cost
- np hard
- undirected graph
- lower bound
- approximation algorithms
- worst case
- spanning tree
- network flow
- upper bound
- network flow problem
- capacity constraints
- edge weights
- special case
- scheduling problem
- edge detection
- np complete
- constant factor
- network simplex algorithm
- minimum cost flow
- optimal solution
- graph mining
- connected components
- weighted graph
- search space
- branch and bound algorithm
- computational complexity