Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming.

Guy Even Nissim Halabi

Published in: IEEE Trans. Inf. Theory (2015)

Keyphrases

linear programming
np hard
min sum
dynamic programming
quadratic programming
packing problem
k means
objective function
simulated annealing
segmentation algorithm
optimal solution
optimization problems
combinatorial optimization
knapsack problem
computational complexity
approximate solutions
similarity measure