Combinatorial incremental problems by Unda Surawski, Francisco T.

Get full text

On the complexity of energy storage problems by Halman, Nir, Nannicini, Giacomo, Orlin, James B

“…Furthermore, no constant-factor approximation algorithm is possible in general unless P = NP. …”
Get full text

Learning-based low-rank approximations by Indyk, Piotr

“…In particular, we give an approximation algorithm for minimizing the empirical loss, with approximation factor depending on the stable rank of matrices in the training set. …”
Get full text

Robust monotone submodular function maximization by Orlin, James B, Schulz, Andreas S, Udwani, Rajan

“…For the fundamental case of $$\tau =1$$ τ = 1 , we give a deterministic $$(1-1/e)-1/\varTheta (m)$$ ( 1 - 1 / e ) - 1 / Θ ( m ) approximation algorithm, where m is an input parameter and number of queries scale as $$O(n^{m+1})$$ O ( n m + 1 ) . …”
Get full text

Algorithms and hardness for diameter in dynamic graphs by Williams, Virginia Vassilevska, Ancona, Bertie, Wein, Nicole

“…This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported. …”
Get full text

Near Optimal Alphabet-Soundness Tradeoff PCPs by Minzer, Dor, Zheng, Kai Zhe

“…This result improves a result of [Khot-Safra 2013] and nearly matches the performance of the best known approximation algorithm [Megrestki 2001, Nemirovski-RoosTerlaky 1999 Charikar-Wirth 2004] that achieves a factor of (log)…”
Get full text

Approximating the double-cut-and-join distance between unsigned genomes by Chen, Xin, Sun, Ruimin, Yu, Jiadong

“…Finally, a polynomial-time approximation algorithm for the problem of sorting unsigned genomes by double-cut-and-join operations is devised, which achieves the approximation ratio 13/9 + e ≈ 1.4444 + e, for any positive ε. …”
Get full text
Get full text

Spectrum sharing for heterogeneous networks and application systems in TV white spaces by Zhang, Wenjie, Zhang, Guanglin, Zheng, Yifeng, Yang, Liwei, Yeo, Chai Kiat

“…Simulation results show that the proposed approximation algorithm can achieve a close-to-optimal solution with far less complexity.…”
Get full text
Get full text

Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches by Subramaniam, Shamala

“…The third algorithm, introduces a delay approximation algorithm to justify packet admission. The fourth algorithm enhances the VC scheduling algorithm. …”
Get full text

Spreading Social Influence with both Positive and Negative Opinions in Online Networks by Jing (Selena) He, Meng Han, Shouling Ji, Tianyu Du, Zhao Li

“…Subsequently, we present a greedy approximation algorithm to address the MPINS selection problem. …”
Get full text

Feasibility Analysis and Application of Reinforcement Learning Algorithm Based on Dynamic Parameter Adjustment by Menglin Li, Xueqiang Gu, Chengyi Zeng, Yuan Feng

“…At the same time, by combining the Robbins–Monro approximation algorithm and deep reinforcement learning algorithm, it is proved that the algorithm of dynamic regulation learning rate can theoretically meet the convergence requirements of the intelligent control algorithm. …”
Get full text

Fast Approximation for Scheduling One Machine by Federico Alonso-Pecina, José Alberto Hernández, José Maria Sigarreta, Nodari Vakhania

“…We propose an approximation algorithm for scheduling jobs with release and delivery times on a single machine with the objective to minimize the makespan. …”
Get full text

Group Degree Centrality and Centralization in Networks by Matjaž Krnc, Riste Škrekovski

“…Then, we describe a greedy approximation algorithm which computes centrality values over all group sizes <i>k</i> from 1 to <i>n</i> in linear time, and achieve a group degree centrality value of at least <inline-formula><math display="inline"><semantics><mrow><mrow><mo>(</mo><mn>1</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>e</mi><mo>)</mo></mrow><mrow><mo>(</mo><msup><mi>w</mi><mo>*</mo></msup><mo>−</mo><mi>k</mi><mo>)</mo></mrow></mrow></semantics></math></inline-formula>, compared to the optimal value of <inline-formula><math display="inline"><semantics><msup><mi>w</mi><mo>*</mo></msup></semantics></math></inline-formula>. …”
Get full text

Multi-Objective Optimization for EE-SE Tradeoff in Space-Air-Ground Internet of Things Networks by Jinyi Zhao, Yanbin Mei, Xiaozheng Gao, Jian Yang, Jiadong Shang

“…We then employ various optimization algorithms such as the Dinkelbach algorithm, successive convex approximation algorithm, Lagrange dual algorithm, and block coordinate descent algorithm to solve the mixed integer non-convex problem. …”
Get full text

High-Precision Log-Ratio Spot Position Detection Algorithm with a Quadrant Detector under Different SNR Environments by Li Huo, Zhiyong Wu, Jiabin Wu, Shijie Gao, Yunshan Chen, Yinuo Song, Shuaifei Wang

“…The experimental results show that when the SNR is 54.10 dB, the maximum error and root mean square error of the spot position of the IILRA are 0.0054 mm and 0.0039 mm, respectively, which are less than half those of the center approximation algorithm (CAA). When the SNR is 23.88 dB, the maximum error and root mean square error of the spot position of the BSNR-IILRA are 0.0046 mm and 0.0034 mm, respectively, which are one-thirtieth and one-twentieth of the CAA, respectively. …”
Get full text

An Enhanced Energy-Efficient Data Collection Optimization Algorithm for UAV Swarm in the Intelligent Internet of Things by Zeyu Sun, Chen Xu, Guoyong Wang, Lan Lan, Mingxing Shi, Xiaofei Xing, Guisheng Liao

“…Secondly, considering the relationship between energy harvesting and energy consumption balance, this paper uses semi-definite programming and a convex approximation algorithm to transform the non-convex optimization problem into a convex optimization problem and realize the mapping relationship between the UAV cluster node and the target node coordinates, which reduces the computational complexity. …”
Get full text

Regularized Submodular Maximization With a <italic>k</italic>-Matroid Intersection Constraint by Qingqin Nong, Zhijia Guo, Suning Gong

“…With the development of the Internet and the emergence of various social-media platforms, designing approximation algorithms for optimization problems such as the influence maximization in social networks has received widespread attention. …”
Get full text

TOTAL WEIGHTED TARDINESS MINIMIZATION FOR TASKS WITH A COMMON DUE DATE ON PARALLEL MACHINES IN CASE OF AGREEABLE WEIGHTS AND PROCESSING TIMES by Alexander Anatolievich Pavlov, Elena Borisovna Misura, Oleg Valentinovich Melnikov

“…We give efficient PSC-algorithm with  complexity that includes the poly­nomial component and the approximation algorithm based on permutations of tasks. The polynomial component contains sufficient signs of optimality of the obtained solutions and allows to obtain an exact solution by polynomial subalgorithm. …”
Get full text

Delay-Sensitive Service Provisioning in Software-Defined Low-Earth-Orbit Satellite Networks by Feihu Dong, Yasheng Zhang, Guiyu Liu, Hongzhi Yu, Chenhua Sun

“…Since this problem is NP-hard, we design an efficient longest continuous path (LCP) approximation algorithm. LCP selects the longest valid path in each topology snapshot that satisfies delay constraints. …”
Get full text

Towards deploying SFC with parallelized VNFs under resource demand uncertainty in mobile edge computing by Kun Zhang, Yu Zhou, Shengrong Zhang, Haifeng Wang, Amin Qourbani

“…Meanwhile, PVRDU uses a Markov-based approximation algorithm to handle resource demand uncertainty. …”
Get full text