The Set Cover with Pairs Problem.

Refael Hassin Danny Segev

Published in: FSTTCS (2005)

Keyphrases

set cover
greedy algorithm
approximation algorithms
network flow
np hard
greedy heuristics
solution space
greedy heuristic
convex hull
pairwise
special case
scheduling problem
primal dual
knapsack problem
integer programming
minimum cost
optimal solution
data points
worst case
objective function
image processing