Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.09389

Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings

Haris Angelidakis
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this thesis, we design algorithms for several NP-hard problems in both worst and beyond worst case settings. In the first part of the thesis, we apply the traditional worst case methodology and design approximation algorithms for the Hub Labeling problem; Hub Labeling is a preprocessing technique introduced to speed up shortest path queries. Before this work, Hub Labeling had been extensively studied mainly in the beyond worst case analysis setting, and in particular on graphs with low highway dimension. In this work, we significantly improve our theoretical understanding of the problem and design (worst-case) algorithms for various classes of graphs, such as general graphs, graphs with unique shortest paths and trees, as well as provide matching inapproximability lower bounds for the problem in its most general settings. Finally, we demonstrate a connection between computing a Hub Labeling on a tree and searching for a node in a tree. In the second part of the thesis, we turn to beyond worst case analysis and extensively study the stability model introduced by Bilu and Linial in an attempt to describe real-life instances of graph partitioning and clustering problems. Informally, an instance of a combinatorial optimization problem is stable if it has a unique optimal solution that remains the unique optimum under small multiplicative perturbations of the parameters of the input. Utilizing the power of convex relaxations for stable instances, we obtain several results for problems such as Edge/Node Multiway Cut, Independent Set (and its equivalent, in terms of exact solvability, Vertex Cover), clustering problems such as $k$-center and $k$-median and the symmetric Traveling Salesman problem. We also provide strong lower bounds for certain families of algorithms for covering problems, thus exhibiting potential barriers towards the design of improved algorithms in this framework.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Haris Angelidakis. 2018-07-24. Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings. https://arxiv.org/abs/1807.09389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗