Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(only showing first 100 items - show all)

Reflected min-Max heaps
Exploiting sparsity in pricing routines for the capacitated arc routing problem
The number of tests required to search an unordered table
Approximate labelled subtree homeomorphism
Time version of the shortest path problem in a stochastic-flow network
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
Finding optimal paths in MREP routing
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
The pairing heap: A new form of self-adjusting heap
Shortest paths in Euclidean graphs
Optimal piecewise linear motion of an object among obstacles
Scheduling jobs with fixed start and end times
A sequential dual simplex algorithm for the linear assignment problem
A computational study of efficient shortest path algorithms
Shortest enclosing walks and cycles in embedded graphs
The k most vital arcs in the shortest path problem
A pointer-free data structure for merging heaps and min-max heaps
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
Shortest path algorithms: A computational study with the C programming language
Two new criteria for finding Steiner hulls in Steiner tree problems
Connected domination and Steiner set on weighted permutation graphs
The point-to-point delivery and connection problems: Complexity and algorithms
An algorithm for finding the \(k\) quickest paths in a network
Fast geometric approximation techniques and geometric embedding problems
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
On the quickest path problem
An efficient algorithm for minimum-weight bibranching
Shortest path algorithms for nearly acyclic directed graphs
Class Steiner trees and VLSI-design
The partial sum criterion for Steiner trees in graphs and shortest paths
Reconstructing a history of recombinations from a set of sequences
Some personal views on the current state and the future of locational analysis
Some new algorithms for location problems on networks
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Parallel algorithms for the assignment and minimum-cost flow problems
Finding the \(k\) quickest simple paths in a network
Balancing problems in acyclic networks
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Analysis of linear structured systems using a primal-dual algorithm
Minimizing a linear multiplicative-type function under network flow constraints
An algorithm for the quickest path problem
Optimal channel allocation for several types of cellular radio networks
The point-to-point connection problem - analysis and algorithms
Improved shortest path algorithms for nearly acyclic graphs
Finding the most vital node of a shortest path.
A new algorithm for reoptimizing shortest paths when the arc costs change
The weighted farthest color Voronoi diagram on trees and graphs.
Shipping problems with body clock constraints.
Finding the first \(K\) shortest paths in a time-window network.
The shortest path problem with forbidden paths
Minimization algorithms for sequential transducers
Semi-dynamic breadth-first search in digraphs
The expected complexity of Prim's minimum spanning tree algorithm
Reachability for airline networks: fast algorithm for shortest path problem with time windows
Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
Computing and listing \(st\)-paths in public transportation networks
Information-theoretic feature selection with discrete \(k\)-median clustering
Costly circuits, submodular schedules and approximate Carathéodory theorems
A new approach for the multiobjective minimum spanning tree
Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
An efficient implementation of a static move descriptor-based local search heuristic
Discrete convexity in joint winner property
Personalized PageRank clustering: a graph clustering algorithm based on random walks
Shortest paths with shortest detours. A biobjective routing problem
The energy-constrained quickest path problem
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
Nonlinear multi-output regression on unknown input manifold
Minimum-cost flows in unit-capacity networks
Faster shortest paths in dense distance graphs, with applications
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Scheduling for electricity cost in a smart grid
Geometric path problems with violations
A biobjective Dijkstra algorithm
Fast approximation of matroid packing and covering
Temporal network optimization subject to connectivity constraints
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
Dealing with residual energy when transmitting data in energy-constrained capacitated networks
Finding the \(K\) shortest paths in a schedule-based transit network
Partially dynamic maintenance of minimum weight hyperpaths
Closest paths in graph drawings under an elastic metric
A faster approximation algorithm for the Steiner tree problem in graphs
The minimum spanning tree problem on a planar graph
On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
The non-approximability of bicriteria network design problems
An algorithm for fractional assignment problems
A note on practical construction of maximum bandwidth paths.
An external memory data structure for shortest path queries
Theory of 2-3 heaps
Minimization of travel time and weighted number of stops in a traffic-light network
Center problems with pos/neg weights on trees
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
A new approach to all-pairs shortest paths on real-weighted graphs
Monge matrices make maximization manageable
Approximating minimum-cost graph problems with spanning tree edges
Matroid optimization with generalized constraints
All-pairs-shortest-length on strongly chordal 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)