An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets.

Iain A. Stewart

Published in: BIT (1993)

Keyphrases

greedy heuristic
np hard
greedy algorithm
knapsack problem
optimal solution
neural network
small number
worst case analysis
data sets
small size
set cover
set theoretic
minimum weight