Pages that link to "Item:Q4840222"
From MaRDI portal
The following pages link to Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (Q4840222):
Displaying 10 items.
- Local matching indicators for concave transport costs (Q990247) (← links)
- An algorithm for computing the restriction s|caffold assignment problem in computational biology (Q1041813) (← links)
- Minimum-weight perfect matching for nonintrinsic distances on the line (Q1762537) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees (Q5326771) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)