A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion.
Matthew DrescherSamuel FioriniTony HuynhPublished in: Eur. J. Comb. (2024)
Keyphrases
- improved algorithm
- theoretical analysis
- experimental evaluation
- convergence rate
- computational complexity
- preprocessing
- optimal solution
- search space
- significant improvement
- detection algorithm
- graph structure
- computationally efficient
- expectation maximization
- particle swarm optimization
- tree structure
- probabilistic model
- computational cost
- error bounds
- classification algorithm
- times faster
- high accuracy
- randomized algorithm
- cost function
- learning algorithm
- recognition algorithm
- randomized approximation
- hamiltonian cycle
- ant colony optimization
- optimization algorithm
- input data
- worst case
- k means
- similarity measure