Login / Signup

Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions.

Apurva MudgalSupantha Pandit
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • set cover
  • greedy algorithm
  • approximation algorithms
  • greedy heuristic
  • optimization problems
  • network flow
  • objective function
  • high dimensional
  • special case
  • multi objective
  • greedy heuristics