O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams.
Tadaaki KirishimaTomoo SumidaYasunori ShionoTakaaki GotoTakeo YakuTetsuro NishinoKensei TsuchidaPublished in: SNPD (2012)
Keyphrases
- optimization problems
- problems in computer vision
- difficult problems
- related problems
- combinatorial optimization
- computational cost
- learning algorithm
- specific problems
- approximate solutions
- computationally efficient
- convex optimization problems
- computational complexity
- theoretical analysis
- hard problems
- computational geometry
- practical problems
- heuristic methods
- benchmark problems
- significant improvement
- search methods
- multi objective
- reinforcement learning
- decision trees
- decision problems
- real world
- computational problems
- tree structure
- machine learning algorithms