An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.
George B. MertziosWalter UngerPublished in: IWOCA (2008)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- learning algorithm
- optimal path
- computational complexity
- cost function
- detection algorithm
- computational cost
- expectation maximization
- graph partitioning
- globally optimal
- neural network
- simulated annealing
- preprocessing
- k means
- particle swarm optimization
- shortest path problem
- spanning tree
- shortest path
- matching algorithm
- recognition algorithm
- significant improvement
- np hard
- optimal parameters
- optimization algorithm
- probabilistic model
- path length
- graph construction
- solution path