Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(only showing first 100 items - show all)

An external memory data structure for shortest path queries
Shortest path queries in digraphs of small treewidth
Matroid optimization with generalized constraints
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
Reflected min-Max heaps
A faster computation of all the best swap edges of a shortest paths tree
An algorithm for load balancing in multiprocessor systems
Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration
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
A computational study of efficient shortest path algorithms
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Semi-dynamic breadth-first search in digraphs
A pointer-free data structure for merging heaps and min-max heaps
Approximating minimum-cost graph problems with spanning tree edges
Single source shortest paths in \(H\)-minor free graphs
A note on practical construction of maximum bandwidth paths.
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Cascade heap: towards time-optimal extractions
A new separation algorithm for the Boolean quadric and cut polytopes
General cops and robbers games with randomness
Computing weighted strength and applications to partitioning
Connected domination and Steiner set on weighted permutation graphs
Algorithms for shortest paths and \(d\)-cycle problems
Spatially-decaying aggregation over a network
Algorithms for searching paths in huge graphs
Finding optimal paths in MREP routing
Approximate distance oracles for graphs with dense clusters
An improved approximation algorithm for the uniform cost-distance Steiner tree problem
Improved algorithms for replacement paths problems in restricted graphs
Cost-based filtering for shorter path constraints
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
The energy-constrained quickest path problem
A new approach for the multiobjective minimum spanning tree
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
Fast geometric approximation techniques and geometric embedding problems
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
Temporal network optimization subject to connectivity constraints
On a pair of job-machine assignment problems with two stages
Shortest path algorithms: A computational study with the C programming language
Efficient parallel algorithms for shortest paths in planar graphs
Two new criteria for finding Steiner hulls in Steiner tree problems
The number of tests required to search an unordered table
Shortest paths with shortest detours. A biobjective routing problem
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
The partial sum criterion for Steiner trees in graphs and shortest paths
Information-theoretic feature selection with discrete \(k\)-median clustering
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
Computing the sequence of \(k\)-cardinality assignments
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

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)