OpenAlex
A 2 Approximation Algorithm For The Minimum Knapsack Problem With A Forcing Graph
Work
Year: 2017
Type: article
Abstract: Carnes and Shmoys [2] presented a 2-approximation algorithm for the minimum knapsack problem. We extend their algorithm to the minimum knapsack problem with a forcing graph (MKPFG), which has a forcin... more
Cites: 17
Cited by: 3
Related to: 10
FWCI: 0.851
Citation percentile (by year/subfield): 54.37
Open Access status: gold