Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(only showing first 100 items - show all)

The \(k\)-centrum multi-facility location problem
Class Steiner trees and VLSI-design
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
The partial inverse minimum spanning tree problem when weight increase is forbidden
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
Fair matchings and related problems
An improved Dijkstra's shortest path algorithm for sparse network
An algorithm for finding the \(k\) quickest paths in a network
Algorithms for topology-free and alignment network queries
Faster algorithm to find anti-risk path between two nodes of an undirected graph
An algorithm for the quickest path problem
Combinatorial auctions with decreasing marginal utilities
The non-approximability of bicriteria network design problems
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Finding the first \(K\) shortest paths in a time-window network.
Fast data transmission and maximal dynamic flow.
A scaling algorithm for maximum weight matching in bipartite graphs
The minmax regret robust shortest path problem in a finite multi-scenario model
Shortest paths in Euclidean graphs
Solving shortest paths efficiently on nearly acyclic directed graphs
The quickest path problem
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Finding \(K\) shortest looping paths with waiting time in a time--window network
Total variation on a tree
Shortest paths in random weighted graphs
Rectilinear paths among rectilinear obstacles
On the quickest path problem
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
Time version of the shortest path problem in a stochastic-flow network
A new algorithm for reoptimizing shortest paths when the arc costs change
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
The shortest path problem with forbidden paths
On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
The all-pairs quickest path problem
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
Finding the most vital node of a shortest path.
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
An algorithm for fractional assignment problems
Scheduling jobs with fixed start and end times
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
Simulation relations for pattern matching in directed graphs
Integrated distribution and loading planning via a compact metaheuristic algorithm
Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
Solving the shortest-paths problem on bipartite permutation graphs efficiently
Finding the k Shortest Paths
Computing all efficient solutions of the biobjective minimum spanning tree problem
Minimum-cost flows in unit-capacity networks
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Shortest path algorithms for nearly acyclic directed graphs
Min-max controllable risk problems
All-pairs-shortest-length on strongly chordal graphs
On weighting two criteria with a parameter in combinatorial optimization problems
The k most vital arcs in the shortest path problem
Faster shortest-path algorithms for planar graphs
An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
A new approach to all-pairs shortest paths on real-weighted graphs
Exploiting sparsity in pricing routines for the capacitated arc routing problem
A simple algorithm for replacement paths problem
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Efficient computation of Lyapunov functions for Morse decompositions
Improved algorithm for all pairs shortest paths
Fast algorithms for the undirected negative cost cycle detection problem
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
Optimal channel allocation for several types of cellular radio networks
Finding reliable shortest paths in road networks under uncertainty
A Dijkstra-type algorithm for dynamic games
A one-shot deviation principle for stability in matching problems
Finding the \(k\) quickest simple paths in a network
Finding the detour-critical edge of a shortest path between two nodes
scientific article; zbMATH DE number 7121921 (Why is no real title available?)
Fast and fine quickest path algorithm
Efficient algorithms for finding the most vital edge of a minimum spanning tree
A filtering technique for all pairs approximate parameterized string matching
The \(b\)-branching problem in digraphs
A polynomial algorithm for the multicriteria cent-dian location problem
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Some graph optimization problems with weights satisfying linear constraints
Finding the shortest paths by node combination
Optimal shortest path set problem in undirected graphs
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
Algorithms for the quickest path problem and the enumeration of quickest paths
Optimal paths in weighted timed automata
Partially dynamic maintenance of minimum weight hyperpaths
On the parameterized complexity of computing balanced partitions in graphs
Faster algorithm for optimum Steiner trees
An efficient algorithm for minimum-weight bibranching
Faster separation of 1-wheel inequalities by graph products
Shortest enclosing walks and cycles in embedded graphs
Sharing information for the all pairs shortest path problem
Parameterized matching with mismatches
Two fast algorithms for all-pairs shortest paths
An improved multiobjective shortest path algorithm
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
The pairing heap: A new form of self-adjusting heap
System reliability for quickest path problems under time threshold and budget
A heuristic improvement of the Bellman-Ford algorithm

This page was built for publication: Fibonacci heaps and their uses in improved network optimization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225293)