Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations.

Khaled M. Elbassioni

Published in: LATIN (2020)

Keyphrases

approximation algorithms
minimum cost
minimization problems
np hard
special case
worst case
network design problem
lp relaxation
integrality gap
linear programming
primal dual
network flow
evolutionary algorithm
message passing
genetic algorithm
total variation
linear program
denoising
scheduling problem