Pages that link to "Item:Q3057531"

The following pages link to The partial inverse minimum cut problem with<i>L</i>₁-norm is strongly NP-hard (Q3057531):

Displaying 2 items.

• Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)