Linear-Time Algorithms for Tree Root Problems.
Maw-Shang ChangMing-Tat KoHsueh-I LuPublished in: SWAT (2006)
Keyphrases
- optimization problems
- run times
- approximate solutions
- theoretical analysis
- np hard problems
- worst case
- computationally efficient
- machine learning algorithms
- computational problems
- learning algorithm
- convex optimization problems
- orders of magnitude
- hard problems
- tree mining
- data sets
- iterative algorithms
- minimum spanning tree
- difficult problems
- heuristic methods
- benchmark problems
- combinatorial optimization
- data mining algorithms
- tree structure
- np complete
- computational cost
- optimal solution