Login / Signup
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Stavros Athanassopoulos
Ioannis Caragiannis
Christos Kaklamanis
Published in:
FCT (2007)
Keyphrases
</>
approximation algorithms
set cover
linear program
primal dual
np hard
special case
linear programming
greedy algorithm
worst case
network flow
optimal solution
minimum cost
greedy heuristic
simplex algorithm
np complete
simplex method
objective function
approximation ratio
quadratic program