Search Results - Additive Approximation Algorithms

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs by Chakraborty, Dibyayan, Vaxès, Yann

“… Our main contribution in this paper is to provide an additive O(δ)-approximation algorithm for k-Geodesic Center on δ-hyperbolic graphs…”
Get full text

Exact and approximate algorithms for clustering problem in wireless sensor networks by Yarinezhad, Ramin, Hashemi, Seyed Naser

“… The authors show that LBCP can be solved by a k-additive approximation algorithm with a running time of $ 2^{O({k}/{\log k})}+O(n) $2O(k/log⁡k)+O(n…”
Get full text

Greedy additive approximation algorithms for minimum-entropy coupling problem by Rossi, Massimiliano

“… solutions that are local minimum [Kocaoglu et al. AAAI'17] and 1-bit approximation [Cicalese et al. ISIT'17]. In this paper, we show that the algorithm proposed by Kocaoglu et al…”
Get full text

Additive approximation algorithm for geodesic centers in \(\delta\)-hyperbolic graphs by Chakraborty, Dibyayan, Vaxès, Yann

“… Our main contribution in this paper is to provide an additive \(O(\delta)\)-approximation algorithm for \textsc{\(k\)-Geodesic Center} on \(\delta\)-hyperbolic graphs…”
Get full text

Additive Approximation Algorithms for Modularity Maximization by Kawase, Yasushi, Matsui, Tomomi, Miyauchi, Atsushi

“…)\), we are asked to find a partition \(\mathcal{C}\) of \(V\) that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical approximation guarantee…”
Get full text

One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation and (k, p)-Clustering by Deshpande, Amit, Pratap, Rameshwar

“… p subspace approximation, previously known subset selection algorithms based on volume sampling and adaptive sampling proposed in Deshpande and Varadarajan (STOC’07, 2007…”
Get full text

Quantum algorithm for an additive approximation of Ising partition functions by Matsuo, Akira, Fujii, Keisuke, Imoto, Nobuyuki

Get full text

Reduced Multiplicative (BURA-MR) and Additive (BURA-AR) Best Uniform Rational Approximation Methods and Algorithms for Fractional Elliptic Equations by Harizanov, Stanislav, Kosturski, Nikola, Lirkov, Ivan, Margenov, Svetozar, Vutov, Yavor

“…Numerical methods for spectral space-fractional elliptic equations are studied. The boundary value problem is defined in a bounded domain of general geometry,…”
Get full text

A group decision making model based on triangular fuzzy additive reciprocal matrices with additive approximation-consistency by Liu, Fang, Liu, Zu-Lin, Wu, Yu-Hao

“…•The concept of additive approximation-consistency is proposed for triangular fuzzy additive reciprocal matrices…”
Get full text

Target-based computer-assisted orchestration: Complexity and approximation algorithms by Bampis, Evripidis, Cella, Carmine-Emanuele, Escoffier, Bruno, Rocco, Mila, Teiller, Alexandre

Get full text

A quantum algorithm for additive approximation of Ising partition functions by Matsuo, Akira, Fujii, Keisuke, Imoto, Nobuyuki

“… We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices…”
Get full text

Additive Approximation Algorithms for List-Coloring Minor-Closed Class of Graphs by Kawarabayashi, Ken-ichi, Demaine, Erik D, Hajiaghayi, Mohammad Taghi

“… This improves the previous multiplicative O(k)-approximation algorithm [20]. Clearly their result also yields an additive approximation algorithm for graph coloring in a minor-closed graph class…”
Get full text

Additive non-approximability of chromatic number in proper minor-closed classes by Dvořák, Zdeněk, Kawarabayashi, Ken-ichi

“…Robin Thomas asked whether for every proper minor-closed class G, there exists a polynomial-time algorithm approximating the chromatic number of graphs from G up to a constant additive error independent on the class G…”
Get full text

A new variational model for removal of combined additive and multiplicative noise and a fast algorithm for its numerical approximation by Chumchob, Noppadol, Chen, Ke, Brito-Loeza, Carlos

“… This paper proposes a new variational model and a fast algorithm for its numerical approximation to remove independent additive and MN from digital images…”
Get full text

Matching with sizes (or scheduling with processing set restrictions) by Biró, Péter, McDermid, Eric

“…) variations of the problems in which the sizes of the jobs are restricted. Specifically, we give an approximation algorithm with an additive error of one when the sizes…”
Get full text

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams by Gawrychowski, Paweł, Merkurev, Oleg, Shur, Arseny M., Uznański, Przemysław

“… Our contribution is twofold. First, we provide lower bounds on the space requirements for randomized approximation algorithms processing inputs of length n…”
Get full text

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private by Tětek, Jakub

“… In this paper, we show a general approach for making Monte-Carlo randomized approximation…”
Get full text

Parameterized algorithms for the Steiner arborescence problem on a hypercube by Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.

“… As m implicitly represents Q→m comprising 2m vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem…”
Get full text

Approximation Algorithm for QoS Routing with Multiple Additive Constraints by Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Baker, F.

“… The problem has been shown to be NP-complete and many approximation algorithms have been developed…”
Get full text

Optimal global approximation of stochastic differential equations with additive Poisson noise by Przybylowicz, Pawel

“…We consider strong global approximation of SDEs driven by a homogeneous Poisson process with intensity λ > 0…”
Get full text