A (4/3+ε)-Approximation Algorithm for Arboricity From Pseudoforest Partitions.
Markus BlumenstockPublished in: CoRR (2018)
Keyphrases
- computational cost
- detection algorithm
- high accuracy
- recognition algorithm
- monte carlo
- times faster
- error bounds
- improved algorithm
- experimental evaluation
- cost function
- significant improvement
- k means
- objective function
- polynomial time approximation
- learning algorithm
- closed form
- expectation maximization
- matching algorithm
- segmentation algorithm
- optimization algorithm
- approximation ratio
- error tolerance
- theoretical analysis
- particle swarm optimization
- linear programming
- graphical models
- worst case
- knn
- probabilistic model
- preprocessing
- optimal solution