Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(only showing first 100 items - show all)

Optimal paths in weighted timed automata
Partially dynamic maintenance of minimum weight hyperpaths
On the parameterized complexity of computing balanced partitions in graphs
Faster algorithm for optimum Steiner trees
An efficient algorithm for minimum-weight bibranching
Faster separation of 1-wheel inequalities by graph products
Shortest enclosing walks and cycles in embedded graphs
Sharing information for the all pairs shortest path problem
Parameterized matching with mismatches
Two fast algorithms for all-pairs shortest paths
An improved multiobjective shortest path algorithm
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
The pairing heap: A new form of self-adjusting heap
System reliability for quickest path problems under time threshold and budget
A heuristic improvement of the Bellman-Ford algorithm
An exterior simplex type algorithm for the minimum cost network flow problem
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
Optimal piecewise linear motion of an object among obstacles
Fast meldable priority queues
The point-to-point connection problem - analysis and algorithms
On transmission time through \(k\) minimal paths of a capacitated-flow network
A sequential dual simplex algorithm for the linear assignment problem
Approximate labelled subtree homeomorphism
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
Algorithms to test open set condition for self-similar set related to P.V. numbers
Solving all-pairs shortest path by single-source computations: theory and practice
An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
Finding the \(K\) shortest paths in a schedule-based transit network
Monge and feasibility sequences in general flow problems
Approximation algorithms for shortest descending paths in terrains
Ridesharing for emergency evacuation
The weak-heap data structure: variants and applications
Some new algorithms for location problems on networks
Retiming synchronous circuitry
Parameterized searching with mismatches for run-length encoded strings
Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
A survey of geodesic paths on 3D surfaces
Graph connectivity and its augmentation: Applications of MA orderings
Balancing problems in acyclic networks
Partial-matching RMS distance under translation: combinatorics and algorithms
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Fibonacci helps to evacuate from a convex region in a grid network
The simultaneous strong metric dimension of graph families
Stochastic flow networks via multiple paths under time threshold and budget constraint
Minimization algorithms for sequential transducers
Two skew-binary numeral systems and one application
Integer priority queues with decrease key in constant time and the single source shortest paths problem
A linear time algorithm for the maximum capacity path problem
A faster approximation algorithm for the Steiner tree problem in graphs
Processing time-dependent shortest path queries without pre-computed speed information on road networks
Some personal views on the current state and the future of locational analysis
The minimum spanning tree problem on a planar graph
Fast algorithms for placing large entries along the diagonal of a sparse matrix
On the point-to-point connection problem
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
A fast minimum spanning tree algorithm based on \(K\)-means
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
Structured connectivity augmentation
Reconstructing a history of recombinations from a set of sequences
Structured connectivity augmentation
Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
Center problems with pos/neg weights on trees
Shortest path computations in source-deplanarized graphs
The point-to-point delivery and connection problems: Complexity and algorithms
Fully dynamic all pairs shortest paths with real edge weights
A method to evaluate routing policy through \(p\) minimal paths for stochastic case
Minimum-weight spanning tree algorithms. A survey and empirical study
Improved shortest path algorithms for nearly acyclic graphs
Priority queues on parallel machines
The saga of minimum spanning trees
Analysis of linear structured systems using a primal-dual algorithm
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

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)