# Assistance and Interdiction Problems on Interval Graphs

@article{Hoang2021AssistanceAI, title={Assistance and Interdiction Problems on Interval Graphs}, author={Hung Phuc Hoang and Stefan Lendl and Lasse Wulf}, journal={ArXiv}, year={2021}, volume={abs/2107.14550} }

We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of original intervals, each interval has a replacement interval such that either the replacement contains the original, or the original contains the replacement. The interdictor is allowed to replace up to k original intervals with their replacements. Using this framework we also study the contrary of interdiction problems…

## References

SHOWING 1-10 OF 21 REFERENCES

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

- MathematicsTheory of Computing Systems
- 2007

It is shown that the short paths node-wise interdiction problem can be efficiently solved by an extension of Dijkstra’s algorithm and the same inapproximability bounds hold for undirected graphs and/or node elimination.

Exact algorithms for the minimum cost vertex blocker clique problem

- MathematicsComput. Oper. Res.
- 2019

Minimum d-blockers and d-transversals in graphs

- MathematicsJ. Comb. Optim.
- 2011

This work considers a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property ℘, and studies d-transversals and d-blockers of stable sets or vertex covers in bipartite and in split graphs.

Minimum vertex blocker clique problem

- Computer ScienceNetworks
- 2014

The first exact algorithm for solving VBCP is developed, which solves the proposed formulation by using a row generation approach, and an analytical lower bound on the cardinality of an optimal solution to V BCP is presented.

A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths

- Computer ScienceNetworks
- 2019

The NP‐hard shortest path most vital edges problem arising in the context of analyzing network robustness is studied by a systematic investigation of various problem‐specific parameters and their influence on the computational complexity.

The most vital nodes with respect to independent set and vertex cover

- Mathematics, Computer ScienceDiscret. Appl. Math.
- 2011

Modern network interdiction problems and algorithms

- Computer Science
- 2013

A network interdiction problem usually involves two players who compete in a min‐max or max‐min game that tries to optimize its objective over the network, for example, as measured by a shortest path, maximum flow, or minimum cost flow.

The Node-Deletion Problem for Hereditary Properties is NP-Complete

- Mathematics, Computer ScienceJ. Comput. Syst. Sci.
- 1980