Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.
Christophe CrespellePhilippe GambettePublished in: WALCOM (2013)
Keyphrases
- tight bounds
- detection algorithm
- experimental evaluation
- approximation ratio
- learning algorithm
- computational cost
- worst case
- optimal solution
- computationally efficient
- times faster
- high accuracy
- dynamic programming
- computational complexity
- optimization algorithm
- monte carlo
- closed form
- improved algorithm
- matching algorithm
- recognition algorithm
- graph partitioning
- linear programming
- preprocessing
- clustering method
- particle swarm optimization
- data sets
- cost function
- special case
- convex hull
- standard deviation
- k means
- search space
- search algorithm
- neural network