On Geometric Set Cover for Orthants.

Karl Bringmann Sándor Kisfaludi-Bak Michal Pilipczuk Erik Jan van Leeuwen

Published in: ESA (2019)

Keyphrases

set cover
greedy algorithm
approximation algorithms
greedy heuristics
np hard
network flow
solution space
greedy heuristic
convex hull
optimal solution
dynamic programming
integer programming
geometric constraints
geometric structure
minimum cost