Pages that link to "Item:Q5054811"
From MaRDI portal
The following pages link to Using sparsification for parametric minimum spanning tree problems (Q5054811):
Displaying 5 items.
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Finding the shortest bottleneck edge in a parametric minimum spanning tree (Q2921758) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- Parametric matroid interdiction (Q6122085) (← links)