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):
Displayed 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Optimal paths in weighted timed automata (Q596026) (← 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)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← 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)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic (Q867921) (← links)
- Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945) (← links)
- An improved Dijkstra's shortest path algorithm for sparse network (Q870157) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- The quickest path problem (Q912765) (← links)
- An algorithm for load balancing in multiprocessor systems (Q917269) (← links)
- Retiming synchronous circuitry (Q920937) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- Reflected min-Max heaps (Q1007603) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- The number of tests required to search an unordered table (Q1014399) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Time version of the shortest path problem in a stochastic-flow network (Q1019780) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Finding optimal paths in MREP routing (Q1029048) (← links)
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- The pairing heap: A new form of self-adjusting heap (Q1087333) (← links)
- Shortest paths in Euclidean graphs (Q1087335) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- Shortest enclosing walks and cycles in embedded graphs (Q1116348) (← links)
- The k most vital arcs in the shortest path problem (Q1119183) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- Algorithms for the quickest path problem and the enumeration of quickest paths (Q1184451) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- An algorithm for finding the \(k\) quickest paths in a network (Q1201855) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)