Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.07052

Sequential Optimization Numbers and Conjecture about Edge-Symmetry and Weight-Symmetry Shortest Weight-Constrained Path

Zile Hui
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of multidimensional sequential optimization numbers. We proof that the k-dimensional sequential optimization numbers, denoted by O_k (n,m), are almost in {O_k (n,a)}, where a belong to[1,eklog(n-1)+(epi)^2/6(2^k-1)+M_1], n is the size of k-dimensional sequential optimization numbers and M_1 is large positive integer. Many achievements of the Stirling numbers of first kind can be transformed into the properties of k-dimensional sequential optimization numbers by k-dimensional extension and we give some examples. Shortest weight-constrained path is NP-complete problem [1]. In the case of edge symmetry and weight symmetry, we use the definition of the optimization set to design 2-dimensional Bellman-Ford algorithm to solve it. According to the fact that P_1 (n,m>M) less than or equal to e^(-M_1 ), where M=elog(n-1)+e+M_1, M_1 is a positive integer and P_1 (n,m) is the probability of 1-dimensional sequential optimization numbers, this paper conjecture that the probability of solving edge-symmetry and weight-symmetry shortest weight-constrained path problem in polynomial time approaches 1 exponentially with the increase of constant term in algorithm complexity. The results of a large number of simulation experiments agree with this conjecture.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Zile Hui. 2022-06-14. Sequential Optimization Numbers and Conjecture about Edge-Symmetry and Weight-Symmetry Shortest Weight-Constrained Path. https://arxiv.org/abs/2206.07052

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↗