Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1309.6078

Discordant Compact Logic-Arithmetic Structures in Discrete Optimization Problems

V. F. Romanov
View original source ↗Read source document ↗Export metadata ↓

Abstract

In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact representation for sets of binary sequences in the form of "compact triplets structures" (CTS) and "compact couples structures" (CCS) is stated, supposing both logic and arithmetic interpretation of data. It is shown that any non-empty CTS in dual interpretation represents some unique Boolean formula in 3-CNF and the tabular CTS contains all satisfyig sets of the formula as concatenations of the triplets chosen from the neighbouring tiers. In general, any 3-CNF formula is transformed by decomposition to a system of discordant CTS's, each being associated with an individual permutation of variables constructed by a polynomial algorithm. As a result the problem of the formula satisfiability is reduced to the following one: ascertain the fact of existence (or absence) of a "joint satisfying set" (JSS) for all discordant structures, based on the different permutations. Further transformation of each CTS to CCS is used; correctness of preservation of the allowed sets is reached by simple algorithmic restrictions on triplets concatenation. Then the procedure of "inverting of the same name columns" in the various structures is entered for the purpose of reducing the problem of JSS revealing to elementary detection of n-tuples of zeros in the CCS system. The formula is synthesized, being on the structure a variation of 2-CNF, associated with the calculation procedure realizing adaptation of the polynomial algorithm of constraints distribution (well-known in the optimization theory) to the efficient resolving Boolean formula coded by means of discordant compact structures.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

V. F. Romanov. 2013-09-24. Discordant Compact Logic-Arithmetic Structures in Discrete Optimization Problems. https://arxiv.org/abs/1309.6078

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↗