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

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)