Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(only showing first 100 items - show all)

Hollow Heaps
Optimal paths in weighted timed automata
Sharing information for the all pairs shortest path problem
An external memory data structure for shortest path queries
General cops and robbers games with randomness
Solving jigsaw puzzles by the graph connection Laplacian
Approximating minimum-cost graph problems with spanning tree edges
Integrated distribution and loading planning via a compact metaheuristic algorithm
On the fast delivery problem with one or two packages
On a technique for finding running tracks of specific length in a road network
How fast can we reach a target vertex in stochastic temporal graphs?
Shortest path computations in source-deplanarized graphs
Shortest paths with shortest detours. A biobjective routing problem
Computing weighted strength and applications to partitioning
SecGDB: graph encryption for exact shortest distance queries with efficient updates
A practical multi-objective auction design and optimization framework for sponsored search
A computational study of efficient shortest path algorithms
Algorithms to test open set condition for self-similar set related to P.V. numbers
A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs
Monge and feasibility sequences in general flow problems
Shortest path algorithms: A computational study with the C programming language
A biobjective Dijkstra algorithm
scientific article; zbMATH DE number 7559196 (Why is no real title available?)
A survey of geodesic paths on 3D surfaces
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
Efficient computation of Lyapunov functions for Morse decompositions
Fast algorithms for the undirected negative cost cycle detection problem
On the shortest path problem with negative cost cycles
Finding reliable shortest paths in road networks under uncertainty
Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
Algorithmic analysis of priority-based bin packing
Theory of 2-3 heaps
Controlled transitions between cupolets of chaotic systems
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
Finding \(K\) shortest looping paths with waiting time in a time--window network
On the point-to-point connection problem
The expected complexity of Prim's minimum spanning tree algorithm
Total variation on a tree
The point-to-point delivery and connection problems: Complexity and algorithms
Fast approximation of matroid packing and covering
Semi-dynamic breadth-first search in digraphs
Fast geometric approximation techniques and geometric embedding problems
Monge matrices make maximization manageable
Faster shortest paths in dense distance graphs, with applications
Parameterized searching with mismatches for run-length encoded strings
A new separation algorithm for the Boolean quadric and cut polytopes
The K-D heap: An efficient multi-dimensional priority queue
Two skew-binary numeral systems and one application
Stabilizing Boolean networks by optimal event-triggered feedback control
Facets from gadgets
Directed shortest paths via approximate cost balancing
Fair matchings and related problems
The partial sum criterion for Steiner trees in graphs and shortest paths
A survey of the all-pairs shortest paths problem and its variants in graphs
Two fast algorithms for all-pairs shortest paths
Partially dynamic maintenance of minimum weight hyperpaths
Tight lower and upper bounds for the complexity of canonical colour refinement
Optimal piecewise linear motion of an object among obstacles
Minimization of travel time and weighted number of stops in a traffic-light network
ANTS on a Plane
A sequential dual simplex algorithm for the linear assignment problem
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
Reflected min-Max heaps
Parameterized matching with mismatches
Improved algorithm for all pairs shortest paths
Cascade heap: towards time-optimal extractions
A combinatorial dynamic network trajectory reservation algorithm for connected autonomous vehicles
On an ordering problem in weighted hypergraphs
Multilevel Artificial Neural Network Training for Spatially Correlated Learning
Fast algorithms for placing large entries along the diagonal of a sparse matrix
Exploiting sparsity in pricing routines for the capacitated arc routing problem
A FastMap-based algorithm for block modeling
Min-max controllable risk problems
A Bayesian spatial scan statistic for multinomial data
Solving third-order linear recurrence relations with applications to number theory and combinatorics
The minmax regret robust shortest path problem in a finite multi-scenario model
Information-theoretic feature selection with discrete \(k\)-median clustering
Matroid optimization with generalized constraints
Solving shortest paths efficiently on nearly acyclic directed graphs
Integer priority queues with decrease key in constant time and the single source shortest paths problem
Improved shortest path algorithms for nearly acyclic graphs
Single source shortest paths in H-minor free graphs
Scheduling jobs with fixed start and end times
The energy-constrained quickest path problem
The k most vital arcs in the shortest path problem
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
Least solutions of equations over N
Faster all-pairs shortest paths via circuit complexity
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
The non-approximability of bicriteria network design problems
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
Reachability for airline networks: fast algorithm for shortest path problem with time windows
The point-to-point connection problem - analysis and algorithms
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
Ridesharing for emergency evacuation
The weighted farthest color Voronoi diagram on trees and graphs.
Shipping problems with body clock constraints.

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)