The two player shortest path network interdiction problem

04/17/2020
by   Simon Busan, et al.
0

In this article, we study a biobjective extension of the shortest path network interdiction problem. Each arc in the network is associated with two integer length values and two players compute their respective shortest paths from source to sink independently from each other while an interdictor tries to lengthen both shortest paths by removing arcs. We show that this problem is intractable and that deciding whether a feasible interdiction strategy is efficient, is NP- complete. We provide a solution procedure to solve the problem on two-terminal series-parallel graphs in pseudopolynomial time. In addition, we show that a variant of the problem with bottleneck objectives can be solved in polynomial time on general directed graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2021

Reconfiguring Shortest Paths in Graphs

Reconfiguring two shortest paths in a graph means modifying one shortest...
research
10/06/2020

On the Bicriterion Maximum Flow Network Interdiction Problem

This article focuses on a biobjective extension of the maximum flow netw...
research
06/12/2019

On the Universal Near-Shortest Simple Paths Problem

This article generalizes the Near-Shortest Paths Problem introduced by B...
research
11/03/2021

Geodesic statistics for random network families

A key task in the study of networked systems is to derive local and glob...
research
07/11/2023

Direct sampling of short paths for contiguous partitioning

In this paper, we provide a family of dynamic programming based algorith...
research
11/30/2020

A Model for Ant Trail Formation and its Convergence Properties

We introduce a model for ant trail formation, building upon previous wor...
research
12/07/2021

Efficient labeling algorithms for adjacent quadratic shortest paths

In this article, we study the Adjacent Quadratic Shortest Path Problem (...

Please sign up or login with your details

Forgot password? Click here to reset