Login / Signup
Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter.
Jaroslaw Byrka
Shanfei Li
Bartosz Rybicki
Published in:
CoRR (2013)
Keyphrases
</>
improved algorithm
detection algorithm
dynamic programming
learning algorithm
computationally efficient
experimental evaluation
search space
times faster
cost function
preprocessing
computational complexity
simulated annealing
significant improvement
np hard
optimization algorithm
high accuracy
theoretical analysis
matching algorithm
worst case
k means
optimal solution
error bounds
parameter tuning
neural network
multiple views
approximation schemes
tree structure
ant colony optimization
clustering method
parameter estimation
em algorithm
particle swarm optimization
computational cost
similarity measure