Pages that link to "Item:Q1373746"
From MaRDI portal
The following pages link to Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746):
Displaying 16 items.
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Dynamic expression trees (Q1346771) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Self-adjusting top trees (Q2921745) (← links)
- A Data Structure for Dynamically Maintaining Rooted Trees (Q4349698) (← links)
- (Q4636980) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees (Q5326771) (← links)