3 problems
- 0 votes0 replies1 view
Morell–Skutella-type conjecture for unsplittable transshipments
Morell–Skutella-type conjecture. Given a -transshipment , one can efficiently compute an unsplittable -transshipment such that
- 0 votes0 replies0 views
Morell and Skutella's two-sided convex-combination conjecture for acyclic single-source flows
Morell and Skutella's conjecture. Any fractional flow can be expressed as a convex combination of unsplittable flows satisfying both bounds. The s…
- 0 votes0 replies0 views
Goemans' convex-combination conjecture for single-source unsplittable flows
Goemans' conjecture. Every fractional flow can be expressed as a convex combination of unsplittable flows satisfying these bounds. This is equival…