An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks by Giorgio Lazzarinetti, Riccardo Dondi, Sara Manzoni, Italo Zoppis

“…Solving combinatorial problems on complex networks represents a primary issue which, on a large scale, requires the use of heuristics and approximate algorithms. Recently, neural methods have been proposed in this context to find feasible solutions for relevant computational problems over graphs. …”
Get full text

EFFICIENCY RESEARCH OF THE THREE-LEVEL MODEL OF SMALL-SERIES PRODUCTION PLANNING by Taras Nikolayevich Lisetsky

“…The solutions obtained by the approximation algo­rithm coincided with those obtained by the exact PSC-algorithm in 99.97 % cases.…”
Get full text

Application of hybrid algorithms in an optimal allocation model of water and land resources by Cong Wei, Jilin Cheng, Yushan Jiang

“…For the above complex nonlinear model, two-hybrid algorithms are proposed: (1) the decomposition aggregation dynamic programming (DADP) method and linear programming (LP) successive approximation algorithm [(DADP–LP)SA] and (2) the DADP algorithm based on the orthogonal design (OD) method (OD–DADP). …”
Get full text

Leveraging Sparse Approximation for Monaural Overlapped Speech Separation From Auditory Perspective by Hiroshi Sekiguchi, Yoshiaki Narusue, Hiroyuki Morikawa

“…We develop a combined model that embeds a sparse approximation algorithm, a multilayered iterative soft thresholding algorithm (ML-ISTA), into a conventional time-domain-based speech separation algorithm, Conv-TasNet. …”
Get full text

Parallel Algorithms for Hierarchical Nucleus Decomposition by Shi, Jessica, Dhulipala, Laxman, Shun, Julian

“…We also introduce a parallel approximation algorithm for nucleus decomposition, which achieves much lower span in theory and better performance in practice. …”
Get full text

Throughput Optimization in Mobile Backbone Networks by Craparo, Emily M., How, Jonathan P., Modiano, Eytan H.

“…This paper presents a theoretical performance guarantee for the approximation algorithm and also demonstrates its empirical performance. …”
Get full text
Get full text
Get full text

Fast graph sampling set selection using gershgorin disc alignment by Bai, Y, Wang, F, Cheung, G, Nakatsukasa, Y, Gao, W

“…The reinterpretation enables us to derive a fast approximation algorithm from a known SC error-bounded approximation algorithm. …”

Anytime approximation in probabilistic databases by Fink, R, Huang, J, Olteanu, D

“…This article describes an approximation algorithm for computing the probability of propositional formulas over discrete random variables. …”

On approximating projection games by Manurangsi, Pasin

Get full text

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover by Ghaffari, Mohsen, Gouleakis, Themistoklis, Konrad, Christian, Mitrović, Slobodan, Rubinfeld, Ronitt

“… • Our O(log log n)-round (1+ ε)-approximate maximum matching algorithm simplifies or improves on the following prior work: O(log² log n)-round (1 + ε)-approximation algorithm of Czumaj et al. [STOC'18] and O(log log n)-round (1 + ε)- approximation algorithm of Assadi et al. …”
Get full text

Access management in joint sensing and communication systems: efficiency versus fairness by Nguyen, Trung Thanh, Elbassioni, Khaled, Luong, Nguyen Cong, Niyato, Dusit, Kim, Dong In

“…For this, we propose a fully polynomial time approximation algorithm, and we prove that the approximation algorithm can guarantee a near-optimal solution with an accuracy bound of epsilon;. …”
Get full text

Systematic design of reaction systems with prescribed behaviors: deterministic and stochastic methods by Plesa, T

“…In particular, the kinetic transformations may be used to construct networks with desired deterministic dynamics, and the noise approximation algorithm may then be used to favorably reprogram the intrinsic noise in the stochastic dynamics, while preserving the deterministic skeleton. …”

Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature by Tyler Helmuth, Ryan L. Mann

“…We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. …”
Get full text

Shape fitting problems in the presence of outliers by Guo, Zhengyang

“…We also give a (7/2, 1 + δ) bi-criteria approximation algorithm whose time complexity is O(n 7 t + δ −1ntlog n). …”
Get full text

Research on the Roundness Approximation Search Algorithm of Si₃N₄ Ceramic Balls Based on Least Square and EMD Methods by Jian Sun, Wei Chen, Jinmei Yao, Zhonghao Tian, Longfei Gao

“…Then the initial signal is used as the input value of the approximation algorithm. Through the roundness deviation approximation algorithm based on the least square method, the given minimum approximation domain range is finely processed. …”
Get full text

Swapping Labeled Tokens on Graphs by Yamanaka, Katsuhisa, Demaine, Erik D., Ito, Takehiro, Kawahara, Jun, Kiyomi, Masashi, Okamoto, Yoshio, Saitoh, Toshiki, Suzuki, Akira, Uchizawa, Kei, Uno, Takeaki

“…We give a polynomial-time 2-approximation algorithm for trees, and using this, obtain a polynomial-time 2α-approximation algorithm for graphs whose tree α-spanners can be computed in polynomial time. …”
Get full text
Get full text

Delay tolerant network (DTN) based routing for mobile and hostile environment and its one step ahead by Zhao, Xinxing

“…There are many research works in this area, I will give some details and want to provide a model based on 3-approximation algorithm as supplements to help the DTN networks to be used in wider research and application areas. …”
Get full text

Monte Carlo Simulation of an American Option by Gikiri Thuo

“…After deriving the gradient estimates we incorporate them in an iterative stochastic approximation algorithm for pricing an option with early exercise features. …”
Get full text

Search tree-based approach for the p-median problem using the ant colony optimization algorithm by Gabriel Bodnariuc, Sergiu Cataranciuc

“…In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. …”
Get full text

Fast progressive polygonal approximations for online strokes by Mohammad Tanvir Parvez

“…This paper presents a fast and progressive polygonal approximation algorithm for online strokes. A stroke is defined as a sequence of points between a pen-down and a pen-up. …”
Get full text