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

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)