A Stronger Conditional Running-Time Lower Bound for Global Label Min-Cut
This paper strengthens the conditional running-time lower bound for a problem in graph theory under the Exponential Time Hypothesis.
This paper improves the previous lower bound for the problem under the Exponential Time Hypothesis.
Before reading this…
To understand this paper, make sure you know these concepts first:
- Graph theoryfind papers →
- Exponential Time Hypothesisfind papers →
Abstract
More Like ThisLet $n$ and $p$ denote the numbers of vertices and labels, respectively, in an undirected edge-labeled graph. Previous work showed that, under the Exponential Time Hypothesis (ETH), there is no deterministic algorithm with running time \[ (np)^{o\left(\frac{\log n}{(\log\log n)^2}\right)}. \] In this paper, we give a deterministic reduction that strengthens this conditional running-time lower bound to \[ (np)^{o\left(\frac{\log n}{\log\log n}\right)}. \]