A 3/2-approximation algorithm for some minimum-cost graph problems.
Basile CouëtouxJames M. DavisDavid P. WilliamsonPublished in: Math. Program. (2015)
Keyphrases
- minimum cost
- np hard
- spanning tree
- approximation algorithms
- approximation ratio
- undirected graph
- dynamic programming
- minimum cost flow
- network flow
- computational complexity
- path planning
- combinatorial optimization
- network simplex algorithm
- minimum cost path
- graph structure
- network flow problem
- optimal solution
- optimization problems
- worst case
- random graphs
- integer linear programming
- linear programming
- search algorithm