The k most vital arcs in the shortest path problem
From MaRDI portal
Publication:1119183
DOI10.1016/0167-6377(89)90065-5zbMath0669.90090OpenAlexW4245095675MaRDI QIDQ1119183
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90065-5
Related Items
A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions, Finding the detour-critical edge of a shortest path between two nodes, Minimizing a stochastic maximum-reliability path, Finding a contra-risk path between two nodes in undirected graphs, A simple algorithm for replacement paths problem, A class of algorithms for mixed-integer bilevel min-max optimization, The k most vital arcs in the shortest path problem, Shortest paths with shortest detours. A biobjective routing problem, On the Power of Tree-Depth for Fully Polynomial FPT Algorithms, Efficient Oracles and Routing Schemes for Replacement Paths, Efficiently Listing Bounded Length st-Paths, A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths, Interdicting the activities of a linear program -- a parametric analysis, Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs, Interdiction problems on planar graphs, Finding the most vital node of a shortest path., Efficient algorithms for game-theoretic betweenness centrality, Unnamed Item, Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs, Fractals for Kernelization Lower Bounds, The tree longest detour problem in a biconnected graph., On short paths interdiction problems: Total and node-wise limited interdiction, Finding Critical Links for Closeness Centrality, Exact and approximate truthful mechanisms for the shortest paths tree problem, NC algorithms for the Single Most Vital Edge problem with respect to shortest paths, Element perturbation problems of optimum spanning trees with two-parameter objectives, Convex hull representation of the deterministic bipartite network interdiction problem, Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs, The most vital edges in the minimum spanning tree problem, Improved algorithms for replacement paths problems in restricted graphs, Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems, Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs, Maximum Capacity Path Interdiction Problem with Fixed Costs, Sequential Shortest Path Interdiction with Incomplete Information, Finding an anti-risk path between two nodes in undirected graphs, Finding the anti-block vital edge of a shortest path between two nodes, Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles, Finding the most vital arcs in a network, Incremental distance products via faulty shortest paths, Unnamed Item, Optimal shortest path set problem in undirected graphs, Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire, The fuzzy shortest path problem and its most vital arcs, Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback, The single most vital arc in the most economical path problem -- a parametric analysis, A faster computation of the most vital edge of a shortest path
Cites Work
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Finding the most vital arcs in a network
- Faster algorithms for the shortest path problem
- A priority queue in which initialization and queue operations takeO(loglogD) time
- An efficient algorithm for K shortest simple paths
- Fibonacci heaps and their uses in improved network optimization algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
