Fibonacci heaps and their uses in improved network optimization algorithms
From MaRDI portal
Publication:5225293
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
- Max-balanced Hungarian scalings
- Worst-case optimal priority queues via extended regular counters
- A short note on Layman permutations
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
- The K-D heap: An efficient multi-dimensional priority queue
- On the spanning trees of weighted graphs
- Complexity and approximation results on the shared transportation problem
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- A metaheuristic algorithm for large maximum weight independent set problems
- Some results on linear recurrence sequences and applications to matrices
- A weight-scaling algorithm for \(f\)-factors of multigraphs
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
- Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks
- The first \(K\) shortest unique-arc walks in a traffic-light network
- Tight lower and upper bounds for the complexity of canonical colour refinement
- A novel pseudo‐polynomial approach for shortest path problems
- Bi-criteria path problem with minimum length and maximum survival probability
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
- Optimal assignments with supervisions
- Greedy differencing edge-contraction heuristic for the max-cut problem
- A Bayesian spatial scan statistic for multinomial data
- Solving third-order linear recurrence relations with applications to number theory and combinatorics
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant
- Efficient modelling of solute transport in heterogeneous media with discrete event simulation
- Steiner problems on directed acyclic graphs
- Priority-based bin packing with subset constraints
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Shortest distances as enumeration problem
- Path planning in a weighted planar subdivision under the Manhattan metric
- Weight biased leftist trees and modified skip lists
- A practical multi-objective auction design and optimization framework for sponsored search
- A new scaling algorithm for the minimum cost network flow problem
- A combinatorial dynamic network trajectory reservation algorithm for connected autonomous vehicles
- Parametric shortest-path algorithms via tropical geometry
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- On matchings, T‐joins, and arc routing in road networks
- Minimization of travel time and weighted number of stops in a traffic-light network
- On an ordering problem in weighted hypergraphs
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- On the fast delivery problem with one or two packages
- On some new arithmetic properties of the generalized Lucas sequences
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- Algebraic theory on shortest paths for all flows
- Finding a smallest odd hole in a claw-free graph using global structure
- Heuristics for the connected assignment problem in arrays
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)