Greedy splitting algorithms for approximating multiway partition problems.
Liang ZhaoHiroshi NagamochiToshihide IbarakiPublished in: Math. Program. (2005)
Keyphrases
- greedy algorithms
- optimization problems
- combinatorial optimization
- related problems
- test problems
- difficult problems
- data structure
- computational problems
- problems in computer vision
- benchmark problems
- greedy algorithm
- theoretical analysis
- approximate solutions
- computational geometry
- specific problems
- np hard problems
- binary trees
- hill climbing
- search algorithm
- np complete
- evolutionary algorithm
- significant improvement
- decision trees
- run times
- partitioning algorithm
- computationally hard
- hard problems
- computational complexity
- greedy search
- search methods
- theoretical guarantees
- computational cost
- linear programming
- machine learning algorithms
- practical problems
- benchmark datasets
- heuristic methods
- learning algorithm