## Abstract

We consider the Sparse Hitting Set (Sparse-HS) problem, where we are given a set system (V, F, B) with two families F, B of subsets of the universe V . The task is to find a hitting set for F that minimizes the maximum number of elements in any of the sets of B. This generalizes several problems that have been studied in the literature. Our focus is on determining the complexity of some of these special cases of Sparse-HS with respect to the sparseness k, which is the optimum number of hitting set elements in any set of B (i.e., the value of the objective function). For the Sparse Vertex Cover (Sparse-VC) problem, the universe is given by the vertex set V of a graph, and F is its edge set. We prove NP-hardness for sparseness k ≥ 2 and polynomial time solvability for k = 1. We also provide a polynomial-time 2-approximation algorithm for any k. A special case of Sparse-VC is Fair Vertex Cover (Fair-VC), where the family B is given by vertex neighbourhoods. For this problem it was open whether it is FPT (or even XP) parameterized by the sparseness k. We answer this question in the negative, by proving NP-hardness for constant k. We also provide a polynomial-time (2 - _{k}^{1})-approximation algorithm for Fair-VC, which is better than any approximation algorithm possible for Sparse-VC or the Vertex Cover problem (under the Unique Games Conjecture). We then switch to a different set of problems derived from Sparse-HS related to the highway dimension, which is a graph parameter modelling transportation networks. In recent years a growing literature has shown interesting algorithms for graphs of low highway dimension. To exploit the structure of such graphs, most of them compute solutions to the r-Shortest Path Cover (r-SPC) problem, where r > 0, F contains all shortest paths of length between r and 2r, and B contains all balls of radius 2r. It is known that there is an XP algorithm that computes solutions to r-SPC of sparseness at most h if the input graph has highway dimension h. However it was not known whether a corresponding FPT algorithm exists as well. We prove that r-SPC and also the related r-Highway Dimension (r-HD) problem, which can be used to formally define the highway dimension of a graph, are both W[1]-hard. Furthermore, by the result of Abraham et al. [ICALP 2011] there is a polynomial-time O(log k)-approximation algorithm for r-HD, but for r-SPC such an algorithm is not known. We prove that r-SPC admits a polynomial-time O(log n)-approximation algorithm.

Original language | English |
---|---|

Title of host publication | 17th International Symposium on Parameterized and Exact Computation, IPEC 2022 |

Editors | Holger Dell, Jesper Nederlof |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

ISBN (Electronic) | 9783959772600 |

DOIs | |

State | Published - 1 Dec 2022 |

Externally published | Yes |

Event | 17th International Symposium on Parameterized and Exact Computation, IPEC 2022 - Potsdam, Germany Duration: 7 Sep 2022 → 9 Sep 2022 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 249 |

ISSN (Print) | 1868-8969 |

### Conference

Conference | 17th International Symposium on Parameterized and Exact Computation, IPEC 2022 |
---|---|

Country/Territory | Germany |

City | Potsdam |

Period | 7/09/22 → 9/09/22 |

## Keywords

- fair vertex cover
- highway dimension
- sparse hitting set

## ASJC Scopus subject areas

- Software