Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09175

An Efficient Algorithm for the Quickest Path Reliability Problem

Majid Forghani-elahabad
View original source ↗Read source document ↗Export metadata ↓

Abstract

The quickest path reliability problem is to compute the probability that a given flow is transmitted along a single source-destination path within a given time limit. When a budget is imposed, path feasibility is jointly dependent on lead time, transmission cost, and capacity. Existing exact methods may require enumeration of all minimal paths a priori or examination of many partial paths that cannot be completed feasibly. In this paper, we propose an exact algorithm that generates the corresponding lower boundary state vectors without first enumerating minimal paths. Shortest-lead-time, least-cost, and widest-capacity information yield admissible destination-based bounds. Stronger capacity-aware bounds are derived from capacity-filtered subnetworks. These bounds allow early pruning of infeasible branches while keeping all solutions. The algorithm generates the exact complete set of lower bounds without any duplicates, and its correctness and computational complexity are proven.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Majid Forghani-elahabad. 2026-10-06. An Efficient Algorithm for the Quickest Path Reliability Problem. https://arxiv.org/abs/2610.09175

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

KEEP EXPLORING

Related papers

arXiv2026

Probabilistic Methods on Erdos Problems

Probability distributions and the rules of inclusion-exclusion apply to derive general results about graph theory and number theory. In order to apply the rules of inclusion-exclusion in the setting some of these problems require, it is necessary to use specific equations and make several assumptions about integration and measure of the probability distributions.

cs.DM↗
arXiv2026

Almost every Boolean function has central threshold degree

The polynomial threshold degree (or threshold degree) of a Boolean function is the least degree of a real polynomial whose sign represents it. We prove that almost every Boolean function has polynomial threshold degree among the central one or two integers. More precisely, a uniformly chosen Boolean function on $n$ variables has threshold degree either $\lfloor n/2\rfloor$ or $\lceil n/2\rceil$, except with probability at most $\exp(-c2^{n/2}/n)$, for an absolute constant $c>0$ and all sufficiently large $n$. The paper proves a 1991 conjecture of Aspnes, Beigel, Furst and Rudich. It also proves a 1991 conjecture of Wang and Williams for even $n$ and its main concentration assertion for odd $n$. A parity example gives a lower bound on the exceptional probability whose exponent differs from ours by a factor of order $n$. The proof relates polynomial sign representation to recovery of Reed--Muller codes from random erasures, and combines sharp-threshold estimates with bounds on generalized Hamming weights and minimum distance.

cs.DM↗
arXiv2026

Near-Optimal Bounds for Testing k-Colorability

We study the sample complexity of testing $k$-colorability in the dense graph model. A graph is $\varepsilon$-far from being $k$-colorable if at least $\varepsilon n^2$ edge deletions are required to make it $k$-colorable. We prove that, for every integer $k\ge 2$, a uniformly random induced subgraph on \[ O\!\left(\frac{k\log k}{\varepsilon}\right) \] vertices is non-$k$-colorable with probability at least $2/3$ whenever the original graph is $\varepsilon$-far from $k$-colorable. The proof introduces a trial coloring process based on nested palette systems and iteratively selected pivots. This yields an upper bound of $O(k\log k/\varepsilon)$, which is no worse than the previous state of the art $O(k\log(1/\varepsilon)/\varepsilon)$ throughout the nonvacuous parameter range, and is an improvement whenever $1/\varepsilon$ is superpolynomial in $k$. Moreover, for every fixed $k$, our bound matches the known lower bound, thereby establishing the optimal $Θ(1/\varepsilon)$ dependence on $\varepsilon$ and, to the best of our knowledge, achieving this optimal dependence for the first time.

cs.DM↗