Pages that link to "Item:Q3191976"

The following pages link to A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976):

Displaying 2 items.

• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Approximating clique-width and branch-width (Q2496203) (← links)