Pages that link to "Item:Q2901004"

The following pages link to Speeding up dynamic shortest-path algorithms (Q2901004):

Displaying 22 items.

• On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
• A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
• An improved Dijkstra's shortest path algorithm for sparse network (Q870157) (← links)
• Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
• Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
• Fast paths in large-scale dynamic road networks (Q2268926) (← links)
• An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
• Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (Q2828206) (← links)
• Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← links)
• Bidirectional \(A^*\) search on time-dependent road networks (Q2892160) (← links)
• Arc-flags in dynamic graphs (Q2917325) (← links)
• Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
• (Q3139284) (← links)
• Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
• Faster algorithms for the shortest path problem (Q3474275) (← links)
• Shortest paths on dynamic graphs (Q3638853) (← links)
• Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
• Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
• Algorithms – ESA 2004 (Q5464616) (← links)
• Experimental and Efficient Algorithms (Q5710012) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)