Pages that link to "Item:Q1119183"

The following pages link to The k most vital arcs in the shortest path problem (Q1119183):

Displaying 46 items.

• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions (Q264305) (← links)
• Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
• Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
• A simple algorithm for replacement paths problem (Q327668) (← links)
• A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
• Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
• NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
• Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
• Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
• Incremental distance products via faulty shortest paths (Q783710) (← links)
• Interdiction problems on planar graphs (Q897609) (← links)
• Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
• Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
• The k most vital arcs in the shortest path problem (Q1119183) (← links)
• The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
• The fuzzy shortest path problem and its most vital arcs (Q1315875) (← links)
• The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
• Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
• Finding the most vital node of a shortest path. (Q1401266) (← links)
• The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
• A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
• Finding the most vital arcs in a network (Q1823164) (← links)
• Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
• Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
• Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
• Efficiently Listing Bounded Length st-Paths (Q2946068) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
• Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
• Fractals for Kernelization Lower Bounds (Q4609787) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• (Q5002751) (← links)
• Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
• (Q5743393) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)