The following pages link to (Q4508378):
Displaying 9 items.
- Minimum spanning trees made easier via multi-objective optimization (Q862963) (← links)
- Geometric lower bounds for parametric matroid optimization (Q1275670) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Finding the shortest bottleneck edge in a parametric minimum spanning tree (Q2921758) (← links)
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching (Q4678134) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)