On generalized greedy splitting algorithms for multiway partition problems.
Liang ZhaoHiroshi NagamochiToshihide IbarakiPublished in: Discret. Appl. Math. (2004)
Keyphrases
- greedy algorithms
- related problems
- optimization problems
- computational complexity
- specific problems
- difficult problems
- test problems
- benchmark problems
- computational efficiency
- run times
- partitioning algorithm
- computational cost
- computationally efficient
- data sets
- computationally hard
- stochastic search
- computational problems
- practical problems
- data mining algorithms
- times faster
- theoretical guarantees
- np complete
- learning algorithm
- hard problems
- orders of magnitude
- lower bound
- problems in computer vision
- search space
- significant improvement
- computational geometry
- approximate solutions
- linear programming
- search algorithm
- machine learning algorithms
- hill climbing
- dynamic programming