An Algorithm for Minimum Cost Arc-Connectivity Orientations.
Satoru IwataYusuke KobayashiPublished in: Algorithmica (2010)
Keyphrases
- np hard
- minimum cost
- network flow problem
- dynamic programming
- network flow
- spanning tree
- objective function
- approximation algorithms
- ant colony optimization
- minimum cost flow
- edit operations
- approximation ratio
- convex hull
- linear programming
- simulated annealing
- upper bound
- evolutionary algorithm
- search space
- computational complexity
- optimal solution