A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces.

Khaled Elbassioni

Published in: Oper. Res. Lett. (2023)

Keyphrases

bicriteria
worst case
shortest path problem
dynamic programming
simulated annealing
linear programming
knapsack problem
convex hull
np hard
cost function
objective function
benchmark problems
solution quality
minimum cost
lower and upper bounds
search space
optimal solution