Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
Anna GalluccioGuido ProiettiPublished in: Algorithmica (2003)
Keyphrases
- optimization problems
- computational cost
- np hard problems
- worst case
- learning algorithm
- difficult problems
- benchmark problems
- orders of magnitude
- practical problems
- related problems
- combinatorial optimization problems
- computational problems
- theoretical analysis
- np hardness
- significant improvement
- combinatorial optimization
- test problems
- np complete
- approximate solutions
- problems in computer vision
- specific problems
- polynomial time complexity
- machine learning algorithms
- special case
- search space
- multiscale