Scaling Algorithms for the Shortest Paths Problem
From MaRDI portal
Recommendations
Cited in
(58)- Maximum weight bipartite matching in matrix multiplication time
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- On the \(K\) shortest path trees problem
- Scaling algorithms for network problems
- Bottleneck shortest paths on a partially ordered scale
- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
- Randomized algorithms for finding the shortest negative cost cycle in networks
- Minimum-cost flows in unit-capacity networks
- A new approach to all-pairs shortest paths on real-weighted graphs
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Unpopularity factor in the marriage and roommates problems
- Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
- On the analysis of optimization problems in arc-dependent networks
- Approximating the minimum cycle mean
- Feasibility checking in Horn constraint systems through a reduction based approach
- Multi-agent differential graphical games: online adaptive learning solution for synchronization with optimality
- A zero-space algorithm for negative cost cycle detection in networks
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- Separation, dimension, and facet algorithms for node flow polyhedra
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- Fair matchings and related problems
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- scientific article; zbMATH DE number 437547 (Why is no real title available?)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- scientific article; zbMATH DE number 3937196 (Why is no real title available?)
- Approximate shortest paths in weighted graphs
- Finding the k Shortest Paths
- An efficient label setting/correcting shortest path algorithm
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Floats, Integers, and Single Source Shortest Paths
- Finding real-valued single-source shortest paths in o(n^3) expected time
- scientific article; zbMATH DE number 1916666 (Why is no real title available?)
- scientific article; zbMATH DE number 1416161 (Why is no real title available?)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- Hybrid Bellman-Ford-Dijkstra algorithm
- A new algorithm for the shortest-path problem
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
- scientific article; zbMATH DE number 5039783 (Why is no real title available?)
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A scaling algorithm for maximum weight matching in bipartite graphs
- Faster shortest-path algorithms for planar graphs
- Shortest paths in almost acyclic graphs
- Solving mean-payoff games via quasi dominions
- Directed shortest paths via approximate cost balancing
- Negative-weight single-source shortest paths in near-linear time
- Maximum flow and minimum-cost flow in almost-linear time
- A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
- Approximate min-sum subset convolution
- Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights
- Lower bounds for adaptive relaxation-based algorithms for single-source shortest paths
- Quantum speedups for polynomial-time dynamic programming algorithms
- A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
- Lower bounds for adaptive relaxation-based algorithms for single-source shortest paths
- Event counting of partially-observed discrete-event systems with uniformly and nonuniformly bounded diagnosis delays
- Trichotomy for integer linear systems based on their sign patterns
This page was built for publication: Scaling Algorithms for the Shortest Paths Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842117)
