Combinatorial algorithms for feedback problems in directed graphs.
Camil DemetrescuIrene FinocchiPublished in: Inf. Process. Lett. (2003)
Keyphrases
- directed graph
- optimization problems
- benchmark problems
- theoretical analysis
- data structure
- computational problems
- difficult problems
- practical problems
- test problems
- orders of magnitude
- learning algorithm
- combinatorial optimization
- approximate solutions
- run times
- np hard problems
- maximum flow
- computational geometry
- evolutionary algorithm
- related problems
- worst case
- problems in computer vision
- significant improvement
- theoretical guarantees
- computational cost
- search methods
- disjoint paths