Scaling algorithms for network problems
From MaRDI portal
minimum spanning treescalingminimum cost flownetwork problemsbottleneck shortest pathdegree- constrained subgraphmaximum network flowweight matching
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)
Recommendations
- Faster Scaling Algorithms for Network Problems
- Computing optimal scalings by parametric network algorithms
- The Scaling Network Simplex Algorithm
- Scaling: a canonical design problem for networks
- scientific article; zbMATH DE number 1003254
- Scalable Algorithms for Data and Network Analysis
- Scaling Algorithms for the Shortest Paths Problem
- scientific article; zbMATH DE number 437547
- scientific article; zbMATH DE number 3900472
- scientific article; zbMATH DE number 1875405
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A Shortest Path Algorithm for Edge-Sparse Graphs
- A data structure for dynamic trees
- A good algorithm for smallest spanning trees with a degree constraint
- A note on two problems in connexion with graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Network Flow and Testing Graph Connectivity
- On a routing problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(51)- River routing in VLSI
- An affine scaling method for solving network flow problems
- A parallel algorithm for eliminating cycles in undirected graphs
- Optimum matchings in weighted bipartite graphs
- Scaling Algorithms for the Shortest Paths Problem
- Approximate min-sum subset convolution
- Short simplex paths in lattice polytopes
- 0/1-Integer programming: Optimization and Augmentation are equivalent
- On the exponent of all pairs shortest path problem
- Critical objective function values in linear sum assignment problems
- scientific article; zbMATH DE number 437547 (Why is no real title available?)
- Single source shortest paths in H-minor free graphs
- Maximum weight bipartite matching in matrix multiplication time
- A filtering technique for all pairs approximate parameterized string matching
- A fast cost scaling algorithm for submodular flow
- Test sets of integer programs
- Weighted approximate parameterized string matching
- A scaling technique for finding the weighted analytic center of a polytope
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- A generalization of the scaling max-flow algorithm
- A linear time algorithm for the maximum capacity path problem
- Bi-criteria and approximation algorithms for restricted matchings
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- The maximum flow problem: A max-preflow approach
- scientific article; zbMATH DE number 1472098 (Why is no real title available?)
- A simple reduction from maximum weight matching to maximum cardinality matching
- Linear-time approximation for maximum weight matching
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Fully dynamic algorithms for minimum weight cycle and related problems
- Parallel algorithms for the assignment and minimum-cost flow problems
- Computational investigations of maximum flow algorithms
- Minimax inverse problems of minimum cuts
- Lexicographic bottleneck combinatorial problems
- A feasibility evaluation approach for time-evolving multi-item production-distribution networks
- Finding all stable pairs and solutions to the many-to-many stable matching problem
- Minimum-cost flows in unit-capacity networks
- Generating pseudo-random permutations and maximum flow algorithms
- A new scaling algorithm for the minimum cost network flow problem
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- Negative-weight single-source shortest paths in near-linear time
- Scaling: a canonical design problem for networks
- AO(nm log(U/n)) time maximum flow algorithm
- Recent developments in maximum flow algorithms
- Scalable Algorithms for Data and Network Analysis
- Maximum flow and minimum-cost flow in almost-linear time
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- Faster Scaling Algorithms for Network Problems
- The symbolic algorithms for maximum flow in networks
This page was built for publication: Scaling algorithms for network problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079135)
