An Incremental Algorithm for a Generalization of the Shortest-Path Problem
From MaRDI portal
Publication:4895806
DOI10.1006/jagm.1996.0046zbMath0861.68035OpenAlexW2029706450MaRDI QIDQ4895806
Publication date: 16 October 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/59604
Related Items (37)
Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ Fully-Dynamic Approximation of Betweenness Centrality ⋮ Formal language constrained path problems ⋮ COStar: A D-star Lite-based dynamic search algorithm for codon optimization ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Anytime search in dynamic graphs ⋮ Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ Continuous-Time Moving Network Voronoi Diagram ⋮ Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ On dynamic shortest paths problems ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Snapshot centrality indices in dynamic FIFO networks ⋮ Incremental Abstract Interpretation ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ A single-source shortest path algorithm for dynamic graphs ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ 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 ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Linear connectivity problems in directed hypergraphs ⋮ Optimization of OSPF Routing in IP Networks ⋮ Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks ⋮ Dynamically Maintaining Shortest Path Trees under Batches of Updates ⋮ Truncated incremental search ⋮ Lifelong planning \(\text{A}^*\) ⋮ Maintaining longest paths incrementally
This page was built for publication: An Incremental Algorithm for a Generalization of the Shortest-Path Problem
