Pages that link to "Item:Q5225293"
From MaRDI portal
The following pages link to Fibonacci heaps and their uses in improved network optimization algorithms (Q5225293):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
- Efficient computation of Lyapunov functions for Morse decompositions (Q258397) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Finding reliable shortest paths in road networks under uncertainty (Q264260) (← links)
- Fair matchings and related problems (Q270032) (← links)
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Fast and fine quickest path algorithm (Q296816) (← links)
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- A simple algorithm for replacement paths problem (Q327668) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- A Dijkstra-type algorithm for dynamic games (Q338209) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- Simulation relations for pattern matching in directed graphs (Q388784) (← links)
- Sharing information for the all pairs shortest path problem (Q391758) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Algorithms to test open set condition for self-similar set related to P.V. numbers (Q401376) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights (Q528469) (← links)
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case (Q621591) (← links)
- System reliability for quickest path problems under time threshold and budget (Q623173) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Stochastic flow networks via multiple paths under time threshold and budget constraint (Q660929) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- On the point-to-point connection problem (Q673909) (← links)
- Shortest path computations in source-deplanarized graphs (Q685480) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Two skew-binary numeral systems and one application (Q692930) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
