Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
From MaRDI portal
(Redirected from Publication:1373746)
Recommendations
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- scientific article; zbMATH DE number 3904297
- Exact and heuristic algorithms for dynamic tree simplification
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Dynamic algorithms for graphs of bounded treewidth
- Dynamic algorithms for graphs of bounded treewidth
- scientific article; zbMATH DE number 4060712
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions
Cites work
- scientific article; zbMATH DE number 432745 (Why is no real title available?)
- scientific article; zbMATH DE number 432805 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1263228 (Why is no real title available?)
- scientific article; zbMATH DE number 871946 (Why is no real title available?)
- A data structure for dynamic trees
- A new approach to the maximum-flow problem
- A polynomial time primal network simplex algorithm for minimum cost flows
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
- An Efficient Parallel Biconnectivity Algorithm
- Biased Search Trees
- Complexity models for incremental computation
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost circulations by canceling negative cycles
- Organization and maintenance of large ordered indexes
- Self-adjusting binary search trees
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Updating a balanced search tree in 0(1) rotations
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Cited in
(20)- A Data Structure for Dynamically Maintaining Rooted Trees
- The inverse Voronoi problem in graphs. II: Trees
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- A multiscale semi-smooth Newton method for optimal transport
- Competitive location and pricing on a line with metric transportation costs
- Multiscale strategies for computing optimal transport
- Simplified group activity selection with group size constraints
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- Dynamic trees in practice
- Heuristics for the dynamic facility location problem with modular capacities
- Batch-parallel Euler tour trees
- A polynomial time primal network simplex algorithm for minimum cost flows
- Dynamic expression trees
- A network simplex method for the budget-constrained minimum cost flow problem
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Self-adjusting top trees
- Power balance and apportionment algorithms for the United States Congress
- scientific article; zbMATH DE number 437542 (Why is no real title available?)
This page was built for publication: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373746)
