An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling.

Authors: Zhao, Jingyang¹ (AUTHOR) jingyangzhao1020@gmail.com, Xiao, Mingyu¹ (AUTHOR) myxiao@uestc.edu.cn

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p988-1006. 19p.

Subject Terms: *Travel costs, Approximation algorithms, Tournaments, Combinatorial optimization

Efficient Approximation Algorithms for Adaptive Minimum Cost Seed Selection via mRR-set Updates

Authors: Feng, Chen, Guo, Gongyao, Li, Yiran, Shi, Jieming, Wang, Sibo

Source: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :1108-1119

Availability: http://dl.acm.org/doi/10.1145/3770855.3818017

Tight Running Times for Minimum ℓ q -Norm Load Balancing: Beyond Exponential Dependencies on 1/ϵ.

Authors: Chen, Lin¹ (AUTHOR) chenlin198662@zju.edu.cn, Tao, Liangde¹ (AUTHOR) vast.tld@gmail.com, Verschae, José² (AUTHOR) jverschae@uc.cl

Source: Mathematics of Operations Research (INFORMS). Aug2026, Vol. 51 Issue 3, p2354-2392. 39p.

Subject Terms: *Scheduling, Approximation algorithms, Computational complexity, Computer scheduling, Number theory

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization

Authors: Cervenjak, Philip, Gan, Junhao, Kakimura, Naonori, Umboh, Seeun William, Wirth, Anthony

Source: Proc. of the 25th International Conference on Autonomous Agents and Multiagent Systems. :1847-1855

Availability: http://dl.acm.org/doi/10.65109/IPZQ7320

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps

Authors: Bei, Xiaohui, Feng, Yuda, Hu, Yang, Li, Shi, Zhang, Ruilong

Source: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :2052-2063

Availability: http://dl.acm.org/doi/10.1145/3798129.3800909

Improved Approximation Algorithms for Non-preemptive Throughput Maximization

Authors: Armbruster, Alexander, Grandoni, Fabrizio, Tinguely, Antoine, Wiese, Andreas

Source: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :2083-2093

Availability: http://dl.acm.org/doi/10.1145/3798129.3800912

Approximation Algorithms for the UAV Path Planning with Object Coverage Constraints.

Authors: Wang, Jiawei¹ (AUTHOR) 220211985@seu.edu.cn, Chau, Vincent¹ (AUTHOR) vincentchau@seu.edu.cn, Wu, Weiwei¹ (AUTHOR) weiweiwu@seu.edu.cn

Source: International Journal of Foundations of Computer Science. Jul2026, p1-25. 25p.

Subject Terms: *Mathematical optimization, *Mathematical programming, Approximation algorithms, Online algorithms, Video surveillance, Time complexity, Robotic path planning, Deterministic algorithms

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks

Authors: Chen, C.

Source: IEEE Transactions on Mobile Computing IEEE Trans. on Mobile Comput. Mobile Computing, IEEE Transactions on. 25(5):7308-7322 May, 2026

An Approximation Algorithm for Generalized Connectivity Problem on Planar Graphs.

Authors: Sun, Jian¹ (AUTHOR) jian_sun@nnu.edu.cn, Wang, Yijing² (AUTHOR) yjwang@amss.ac.cn

Source: International Journal of Foundations of Computer Science. Aug2026, Vol. 37 Issue 5, p641-651. 11p.

Subject Terms: *Algorithms, Approximation algorithms, Planar graphs, Graph connectivity, Graph theory, Graph algorithms

A Fast Approximation Algorithm for the Top-$K$K Group Betweenness Centrality

Authors: Xu, W., Li, J., Liang, W., Xu, Z., Peng, J., Zhou, P., Zhao, C., Yan, B., Jia, X., Yu, J.X.

Source: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 38(6):3335-3348 Jun, 2026

Scheduling with Calibrations for Multi-Interval Jobs.

Authors: Chau, Vincent¹ (AUTHOR) vincentchau@seu.edu.cn, Damerius, Christoph² (AUTHOR) christoph.damerius@uni-hamburg.de, Kling, Peter² (AUTHOR) peter.kling@uni-hamburg.de, Li, Minming³ (AUTHOR) minming.li@cityu.edu.hk, Schneider, Florian² (AUTHOR) fschneider@informatik.uni-hamburg.de, Zhang, Ruilong³ (AUTHOR) ruilzhang4-c@my.cityu.edu.hk

Source: INFORMS Journal on Computing. Mar/Apr2026, Vol. 38 Issue 2, p377-396. 20p.

Subject Terms: *Scheduling, *Computer science, *Algorithms, *Mathematical optimization, Approximation algorithms, Computational complexity

Scheduling UAV-Based Deliveries With an Approximation Algorithm

Authors: Attenni, G., Arrigoni, V., Finelli, M., Bartolini, N.

Source: IEEE Transactions on Vehicular Technology IEEE Trans. Veh. Technol. Vehicular Technology, IEEE Transactions on. 75(6):9144-9156 Jun, 2026

A coupled task scheduling approximation algorithm for minimizing the sum of completion times.

Authors: Békési, József¹ (AUTHOR) bekesi@inf.u-szeged.hu, Dósa, György² (AUTHOR) dosa.gyorgy@mik.uni-pannon.hu, Galambos, Gábor³ (AUTHOR) GalambosGabor@szte.hu

Source: Annals of Operations Research. Jul2026, Vol. 362 Issue 1-3, p1-26. 26p.

Subject Terms: *Scheduling, *Algorithms, Approximation algorithms, Asymptotic analysis, Greedy algorithms

An Approximation Algorithm for Minimizing the Number of Distance Constrained Mobile Sinks for Data Collection from Static and Mobile Sensors

Authors: Kumar, Rohit, Mukherjee, Joy Chandra

Source: 2026 18th International Conference on COMmunication Systems and NETworks (COMSNETS) COMmunication Systems and NETworks (COMSNETS), 2026 18th International Conference on. :1-9 Jan, 2026

Relation: 2026 18th International Conference on COMmunication Systems and NETworks (COMSNETS)

Complexity and approximation algorithm for scheduling communication delays problem with limited communication resource.

Authors: Giroudeau, Rodolphe¹ (AUTHOR) rodolphe.giroudeau@lirmm.fr, König, J.-C.¹ (AUTHOR)

Source: RAIRO: Operations Research (2804-7303). 2026, Vol. 60 Issue 4, p2673-2687. 15p.

Subject Terms: *Scheduling, *Resource allocation, Approximation algorithms, Bipartite graphs, Computational complexity, Polynomial time algorithms

Chance Constrained AC Security Constrained Optimal Power Flow via the Inner-Outer Approximation Algorithm

Authors: Chacko, K., Alizadeh, M.I., Capitanescu, F., Li, P.

Source: IEEE Transactions on Industry Applications IEEE Trans. on Ind. Applicat. Industry Applications, IEEE Transactions on. 62(4):5886-5896 Aug, 2026

Improved Approximation Algorithms for the Expanding Search Problem

Authors: Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior

Contributors: Svenja M. Griesbach and Felix Hommelsheim and Max Klimm and Kevin Schewior, Li Gortz, Inge, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz

Source: Griesbach, S M, Hommelsheim, F, Klimm, M & Schewior, K 2026, 'Improved Approximation Algorithms for the Expanding Search Problem', SIAM Journal on Discrete Mathematics, vol. 40, no. 1, pp. 349-373. https://doi.org/10.1137/25M1759902
Griesbach, S M, Hommelsheim, F, Klimm, M & Schewior, K 2023, Improved Approximation Algorithms for the Expanding Search Problem. in I Li Gortz, M Farach-Colton, S J Puglisi & G Herman (eds), 31st Annual European Symposium on Algorithms, ESA 2023., 54, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, vol. 274, 31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, Netherlands, 04/09/2023. https://doi.org/10.4230/LIPIcs.ESA.2023.54

Subject Terms: FOS: Computer and information sciences, Search Problem, hardness of approximation, Euclidean graph, minimum latency problem, expanding search problem, traveling repairperson problem, Expanding Search, 0102 computer and information sciences, 68W25, 68R12, 01 natural sciences, Graph Exploration, Traveling Repairperson Problem, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithm, Approximation Algorithm

File Description: application/pdf

Access URL: http://arxiv.org/abs/2301.03638
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.54
https://portal.findresearcher.sdu.dk/da/publications/e66b48c1-e82d-4097-86af-e0715532eafd
https://doi.org/10.4230/LIPIcs.ESA.2023.54
https://portal.findresearcher.sdu.dk/da/publications/e66b48c1-e82d-4097-86af-e0715532eafd
https://findresearcher.sdu.dk/ws/files/243024319/LIPIcs_ESA_2023_54.pdf
https://doi.org/10.4230/LIPIcs.ESA.2023.54

Approximation Algorithms for Solving the Generalized $P$-Steiner Forest Problem

Authors: Fu, Yao, Zhang, Tongquan, Wang, Wencheng

Source: 2025 9th International Workshop on Control Engineering and Advanced Algorithms (IWCEAA) Control Engineering and Advanced Algorithms (IWCEAA), 2025 9th International Workshop on. :286-290 Oct, 2025

Relation: 2025 9th International Workshop on Control Engineering and Advanced Algorithms (IWCEAA)

Approximation Algorithms for the Maximum Multi-Commodity Service DAG Flow

Authors: Li, Peng, Zhang, Jianan

Source: 2026 IFIP Networking Conference (IFIP Networking) Networking Conference (IFIP Networking), 2026 IFIP. :1-9 May, 2026

Relation: 2026 IFIP Networking Conference (IFIP Networking)

Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage.

Authors: Liang, Wei¹ (AUTHOR) lvecho1019@zjnu.edu.cn, Tang, Shaojie² (AUTHOR) shaojiet@buffalo.edu, Zhang, Zhao¹ (AUTHOR) hxhzz@sina.com

Source: Mathematical Programming. Sep2026, Vol. 219 Issue 1/2, p829-864. 36p.

Subject Terms: Approximation algorithms, Polynomial time algorithms, Graph theory, Applied sciences