Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.11315

Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio

Édouard Bonnet
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show, assuming the Strong Exponential Time Hypothesis, that for every $\varepsilon > 0$, approximating directed Diameter on $m$-arc graphs within ratio $7/4 - \varepsilon$ requires $m^{4/3 - o(1)}$ time. Our construction uses nonnegative edge weights but even holds for sparse digraphs, i.e., for which the number of vertices $n$ and the number of arcs $m$ satisfy $m = n \log^{O(1)} n$. This is the first result that conditionally rules out a near-linear time $5/3$-approximation for Diameter.

Explore related subjects

cs.DScs.CCmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Édouard Bonnet. 2021-02-08. Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio. https://arxiv.org/abs/2008.11315

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

KEEP EXPLORING

Related papers

arXiv2026

Infrequent Resolving Algorithm for Online Linear Programming

Online linear programming (OLP) has gained significant attention from both researchers and practitioners due to its extensive applications such as online auctions, network revenue management, order fulfillment and advertising. Existing OLP algorithms fall into two categories: LP-based algorithms and LP-free algorithms. The former typically guarantees better performance but requires solving a large number of LPs, which could be computationally expensive. In contrast, LP-free algorithms only require first-order computations but induce a worse performance. In this work, we bridge the gap between these two extremes by proposing a well-performing algorithm that solves LPs at a few selected time points and conducts first-order computations at other time points. Specifically, for the case where the inputs are drawn from an unknown finite-support distribution, the proposed algorithm achieves a constant regret (even for the hard "degenerate" case) while solving LPs only $O(\log\log T)$ times over the time horizon $T$. Moreover, when we are allowed to solve LPs only $M$ times, we design the corresponding schedule such that the proposed algorithm can guarantee a nearly $O\left(T^{(1/2)^{M-1}}\right)$ regret. Our work highlights the value of resolving both at the beginning and the end of the selling horizon, and provides a novel framework to prove the performance guarantee of the proposed policy under different infrequent resolving schedules. Numerical experiments are conducted to demonstrate the efficiency of the proposed algorithms. The code is available at https://github.com/guokai-li/infrequent_resolving_olp.

cs.DS↗
arXiv2026

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means

The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes, approximation algorithms limited to specific graph classes, and heuristics with no formal guarantees. In this paper, we exploit optimum cycle means (minimum and maximum cycle means), computable in strongly polynomial time, to derive both strict bounds and heuristic estimates for the weight and length of the longest simple cycle in general graphs. The strict bounds can prune search spaces in exact algorithms while the heuristic estimates (the arithmetic mean and geometric mean of the optimum cycle means) guarantee bounded approximation error. Crucially, a single computation of optimum cycle means yields both the bounds and the heuristic estimates. Experimental evaluation on ISCAS benchmark circuits yields two findings. The strict lower bounds on the weight and length of the longest cycle are loose, with medians 57--95% below the true values. The heuristic estimates of the longest cycle's mean, the arithmetic mean and geometric mean, have median relative errors of 6--13% vs. 11--21% for symmetric (uniform) weights and 41--92% vs. 25--35% for skewed (log-normal) weights, favoring the arithmetic mean for symmetric distributions and the geometric mean for skewed distributions.

cs.DS↗
arXiv2026

A 3.1462-Competitive Algorithm for Matroid Secretary

The matroid secretary problem asks an online algorithm to select a high-weight independent set from elements arriving in uniformly random order, with immediate and irrevocable decisions. Singla (2026) recently gave a $4$-competitive algorithm for arbitrary matroids using only the number of elements and independence queries on already-arrived elements. Following his approach of maintaining a dynamically updated reference set, we introduce random deletions and a time-dependent acceptance rule, improving the competitive ratio to $C_*\approx3.1462$ in the same information model, where $C_*-\log C_*=2$. Our ordinal algorithm accepts every element of a fixed canonical optimum with probability exactly $1/C_*$ and uses $O(n^2)$ independence queries. The algorithm maintains a greedy reference solution, protects only accepted elements, and randomly deletes unaccepted reference-basis elements. A time-dependent acceptance rule makes the accepted set, conditional on the reference set, an independent thinning of its greedy basis. The resulting guarantee has a direct analytic proof.

cs.DS↗