An Incremental Algorithm for a Generalization of the Shortest-Path Problem
From MaRDI portal
Recommendations
Cited in
(38)- Linear connectivity problems in directed hypergraphs
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- Partially dynamic maintenance of minimum weight hyperpaths
- An auction-based approach for the re-optimization shortest path tree problem
- Anytime search in dynamic graphs
- Finding the \(K\) best policies in a finite-horizon Markov decision process
- Fully dynamic all pairs shortest paths with real edge weights
- Truncated incremental search
- COStar: A D-star Lite-based dynamic search algorithm for codon optimization
- Maintaining shortest paths under deletions in weighted directed graphs
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Dynamically maintaining shortest path trees under batches of updates
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- Continuous-time moving network Voronoi diagram
- Incremental Abstract Interpretation
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- Optimization of OSPF routing in IP networks
- Fully-dynamic approximation of betweenness centrality
- Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- A single-source shortest path algorithm for dynamic graphs
- Shortest path reoptimization vs resolution from scratch: a computational comparison
- Formal language constrained path problems
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Sparse weight tolerant subgraph for single source shortest path
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Intra-domain traffic engineering with shortest path routing protocols
- Intra-domain traffic engineering with shortest path routing protocols
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- On dynamic shortest paths problems
- Grammar semantics, analysis and parsing by abstract interpretation
- Snapshot centrality indices in dynamic FIFO networks
- Lifelong planning \(\text{A}^*\)
- Maintaining longest paths incrementally
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
This page was built for publication: An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895806)
