Pages that link to "Item:Q5267564"

The following pages link to A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564):

Displaying 2 items.

• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)