Fibonacci heaps and their uses in improved network optimization algorithms

Cited In (only showing first 100 items - show all)

Integrated distribution and loading planning via a compact metaheuristic algorithm
Efficient computation of Lyapunov functions for Morse decompositions
Fast algorithms for the undirected negative cost cycle detection problem
Finding reliable shortest paths in road networks under uncertainty
Finding \(K\) shortest looping paths with waiting time in a time--window network
Total variation on a tree
Fair matchings and related problems
A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
Improved algorithm for all pairs shortest paths
Min-max controllable risk problems
Exploiting sparsity in pricing routines for the capacitated arc routing problem
The minmax regret robust shortest path problem in a finite multi-scenario model
Solving shortest paths efficiently on nearly acyclic directed graphs
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
Scheduling jobs with fixed start and end times
The k most vital arcs in the shortest path problem
The non-approximability of bicriteria network design problems
Shortest path algorithms for nearly acyclic directed graphs
A filtering technique for all pairs approximate parameterized string matching
The \(b\)-branching problem in digraphs
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Finding the most vital node of a shortest path.
Finding the detour-critical edge of a shortest path between two nodes
Fast and fine quickest path algorithm
Computing all efficient solutions of the biobjective minimum spanning tree problem
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
Solving the shortest-paths problem on bipartite permutation graphs efficiently
Title not available (Why is that?)
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
A polynomial algorithm for the multicriteria cent-dian location problem
The quickest path problem
A new approach to all-pairs shortest paths on real-weighted graphs
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Class Steiner trees and VLSI-design
A scaling algorithm for maximum weight matching in bipartite graphs
A simple algorithm for replacement paths problem
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
An algorithm for finding the \(k\) quickest paths in a network
On the quickest path problem
An algorithm for fractional assignment problems
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Finding the \(k\) quickest simple paths in a network
The \(k\)-centrum multi-facility location problem
An algorithm for the quickest path problem
A new algorithm for reoptimizing shortest paths when the arc costs change
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
A Dijkstra-type algorithm for dynamic games
Finding the shortest paths by node combination
Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
The shortest path problem with forbidden paths
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
Faster shortest-path algorithms for planar graphs
Some graph optimization problems with weights satisfying linear constraints
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Rectilinear paths among rectilinear obstacles
Finding the k Shortest Paths
All-pairs-shortest-length on strongly chordal graphs
On weighting two criteria with a parameter in combinatorial optimization problems
Optimal channel allocation for several types of cellular radio networks
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
A one-shot deviation principle for stability in matching problems
Combinatorial auctions with decreasing marginal utilities
Time version of the shortest path problem in a stochastic-flow network
Minimum-cost flows in unit-capacity networks
On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
The all-pairs quickest path problem
Finding the first \(K\) shortest paths in a time-window network.
Shortest paths in Euclidean graphs
Shortest paths in random weighted graphs
Fast data transmission and maximal dynamic flow.
An improved Dijkstra's shortest path algorithm for sparse network
Algorithms for topology-free and alignment network queries
Faster algorithm to find anti-risk path between two nodes of an undirected graph
A faster algorithm for the single source shortest path problem with few distinct positive lengths
The partial inverse minimum spanning tree problem when weight increase is forbidden
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
Simulation relations for pattern matching in directed graphs
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Optimal shortest path set problem in undirected graphs
An external memory data structure for shortest path queries
Approximating minimum-cost graph problems with spanning tree edges
Computing weighted strength and applications to partitioning
General cops and robbers games with randomness
Shortest paths with shortest detours. A biobjective routing problem
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
A computational study of efficient shortest path algorithms
Shortest path algorithms: A computational study with the C programming language
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
Algorithmic analysis of priority-based bin packing
Semi-dynamic breadth-first search in digraphs
A new separation algorithm for the Boolean quadric and cut polytopes
Fast geometric approximation techniques and geometric embedding problems
The partial sum criterion for Steiner trees in graphs and shortest paths
Cascade heap: towards time-optimal extractions

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)