Algorithms to solve the knapsack constrained maximum spanning tree problem.
Takeo YamadaKohtaro WatanabeSeiji KataokaPublished in: Int. J. Comput. Math. (2005)
Keyphrases
- computational efficiency
- dynamic programming
- orders of magnitude
- computationally efficient
- maximum number
- data mining algorithms
- significant improvement
- benchmark datasets
- theoretical analysis
- worst case
- lagrange multipliers
- recently developed
- optimization problems
- database
- upper bound
- computational cost
- search algorithm
- data structure
- image processing
- learning algorithm
- data mining