- Gabriele Eichfelder
, Leo Warnow
:
An approximation algorithm for multi-objective optimization problems using a box-coverage. J. Glob. Optim. 83(2): 329-357 (2022) - Francesco Marchetti
, Emma Perracchione
:
Efficient Reduced Basis Algorithm (ERBA) for Kernel-Based Approximation. J. Sci. Comput. 91(2): 41 (2022) - Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat
:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. Math. Oper. Res. 47(2): 847-877 (2022) - Vera Traub
, Thorben Tröbst
:
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. 192(1): 497-518 (2022) - Chunying Ren, Dachuan Xu
, Donglei Du, Min Li
:
An improved primal-dual approximation algorithm for the k-means problem with penalties. Math. Struct. Comput. Sci. 32(2): 151-163 (2022) - Geovani Nunes Grapiglia
, Max L. N. Gonçalves, G. N. Silva:
A cubic regularization of Newton's method with finite difference Hessian approximations. Numer. Algorithms 90(2): 607-630 (2022) - Guoting Song, Junhao Hu, Shuaibin Gao
, Xiaoyue Li
:
The strong convergence and stability of explicit approximations for nonlinear stochastic delay differential equations. Numer. Algorithms 89(2): 855-883 (2022) - Laleh Ghalami, Daniel Grosu
:
Approximation algorithms for Steiner forest: An experimental study. Networks 79(2): 164-188 (2022) - Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum partial multi-cover under a geometric setting. Optim. Lett. 16(2): 667-680 (2022) - Steffen Borgwardt
:
An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters. Oper. Res. 22(2): 1511-1551 (2022) - Takuro Fukunaga, R. Ravi
, Oleksandr Rudenko
, Ziye Tang
:
Approximation algorithm for the 2-stage stochastic matroid base problem. Oper. Res. Lett. 50(2): 129-132 (2022) - Sven O. Krumke, Le Huy Minh
:
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem. Oper. Res. Lett. 50(6): 732-737 (2022) - Yotaro Takazawa
:
Approximation algorithm for the stochastic prize-collecting set multicover problem. Oper. Res. Lett. 50(2): 224-228 (2022) - Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur
, Zoltán Szigeti, Lu Wang:
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36(3): 1730-1747 (2022) - Luan Portella
, Diego F. G. Coelho
, Fábio M. Bayer
, Arjuna Madanayake
, Renato J. Cintra
:
Radix-$N$ Algorithm for Computing $N{2{n}}$-Point DFT Approximations. IEEE Signal Process. Lett. 29: 1838-1842 (2022) - Tzu-Tsung Wong
:
Linear Approximation of F-Measure for the Performance Evaluation of Classification Algorithms on Imbalanced Data Sets. IEEE Trans. Knowl. Data Eng. 34(2): 753-763 (2022) - Dimitra Tsigkari
, Thrasyvoulos Spyropoulos:
An Approximation Algorithm for Joint Caching and Recommendations in Cache Networks. IEEE Trans. Netw. Serv. Manag. 19(2): 1826-1841 (2022) - Huan Lan:
A 1/2 Approximation Algorithm for Energy-Constrained Geometric Coverage Problem. NCTCS 2022: 105-114 - Fabrizio Grandoni, Claire Mathieu, Hang Zhou:
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR abs/2209.05520 (2022) - Azzam Habib:
Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem. CoRR abs/2210.09844 (2022) - 2021
- Diodato Ferraioli
, Carmine Ventre
:
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location. Algorithmica 83(2): 695-725 (2021) - András Faragó
, Zohre R. Mojaveri
:
Safe Approximation - An Efficient Solution for a Hard Routing Problem. Algorithms 14(2): 48 (2021) - Danny Hucke, Carl Philipp Reh:
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. Algorithms 14(2): 65 (2021) - Leonid V. Moroz
, Volodymyr Samotyy
, Oleh Horyachyy
:
Modified Fast Inverse Square Root and Square Root Approximation Algorithms: The Method of Switching Magic Constants. Comput. 9(2): 21 (2021) - Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis:
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. Discret. Math. Algorithms Appl. 13(2): 2150008:1-2150008:48 (2021) - Effat Soleimani
, Hazhir Saberi, Niloofar Ayoobi-Yazdi:
Optimized geometry of the carotid artery cross-section: Comparison between circular and elliptical approximations in B-mode ultrasound images. Discret. Math. Algorithms Appl. 13(2): 2150004:1-2150004:15 (2021) - Jincao Li, Ming Xu:
A parametric approximation algorithm for spatial group keyword queries. Intell. Data Anal. 25(2): 305-319 (2021) - Yingli Ran, Zhao Zhang
, Shaojie Tang
, Ding-Zhu Du:
Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. INFORMS J. Comput. 33(2): 774-784 (2021) - Abbass Gorgi
, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41(2): 433-450 (2021) - Siwen Wang, Zi Xu
:
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints. J. Optim. Theory Appl. 190(2): 524-539 (2021)