Approximation algorithm for coloring of dotted interval graphs.
Vladimir YanovskiPublished in: Inf. Process. Lett. (2008)
Keyphrases
- experimental evaluation
- cost function
- preprocessing
- times faster
- closed form
- graph model
- error bounds
- np hard
- high accuracy
- detection algorithm
- graph structure
- segmentation algorithm
- optimal solution
- computational cost
- objective function
- theoretical analysis
- dynamic programming
- tree structure
- genetic algorithm
- weighted graph
- approximation guarantees
- directed graph
- matching algorithm
- optimization algorithm
- k means
- search space
- learning algorithm