Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Paul S. BonsmaFrederic DornPublished in: CoRR (2008)
Keyphrases
- tight bounds
- optimization problems
- benchmark problems
- difficult problems
- computationally efficient
- metaheuristic
- data structure
- significant improvement
- theoretical analysis
- greedy algorithms
- times faster
- inference problems
- orders of magnitude
- computational problems
- problems in computer vision
- approximate solutions
- efficient solutions
- np complete
- worst case
- np hard problems
- computational cost
- learning algorithm
- computationally hard
- small data sets
- hard problems
- theoretical guarantees
- run times
- data sets
- practical problems
- related problems
- heuristic methods
- test problems
- graph theory
- search methods
- computational efficiency
- benchmark datasets
- multi class
- computational complexity
- genetic algorithm