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

Συγγραφείς: Zhao, Jingyang¹ (AUTHOR) jingyangzhao1020@gmail.com, Xiao, Mingyu¹ (AUTHOR) myxiao@uestc.edu.cn

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

Θεματικοί όροι: *Travel costs, Approximation algorithms, Tournaments, Combinatorial optimization

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

Συγγραφείς: Feng, Chen, Guo, Gongyao, Li, Yiran, Shi, Jieming, Wang, Sibo

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

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3770855.3818017

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

Συγγραφείς: Chen, Lin¹ (AUTHOR) chenlin198662@zju.edu.cn, Tao, Liangde¹ (AUTHOR) vast.tld@gmail.com, Verschae, José² (AUTHOR) jverschae@uc.cl

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

Θεματικοί όροι: *Scheduling, Approximation algorithms, Computational complexity, Computer scheduling, Number theory

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization

Συγγραφείς: Cervenjak, Philip, Gan, Junhao, Kakimura, Naonori, Umboh, Seeun William, Wirth, Anthony

Πηγή: Proc. of the 25th International Conference on Autonomous Agents and Multiagent Systems. :1847-1855

Διαθεσιμότητα: http://dl.acm.org/doi/10.65109/IPZQ7320

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

Συγγραφείς: Bei, Xiaohui, Feng, Yuda, Hu, Yang, Li, Shi, Zhang, Ruilong

Πηγή: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :2052-2063

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3798129.3800909

Improved Approximation Algorithms for Non-preemptive Throughput Maximization

Συγγραφείς: Armbruster, Alexander, Grandoni, Fabrizio, Tinguely, Antoine, Wiese, Andreas

Πηγή: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :2083-2093

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3798129.3800912

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks

Συγγραφείς: Chen, C.

Πηγή: 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.

Συγγραφείς: Sun, Jian¹ (AUTHOR) jian_sun@nnu.edu.cn, Wang, Yijing² (AUTHOR) yjwang@amss.ac.cn

Πηγή: International Journal of Foundations of Computer Science. Aug2026, Vol. 37 Issue 5, p641-651. 11p.

Θεματικοί όροι: *Algorithms, Approximation algorithms, Planar graphs, Graph connectivity, Graph theory, Graph algorithms

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

Συγγραφείς: Xu, W., Li, J., Liang, W., Xu, Z., Peng, J., Zhou, P., Zhao, C., Yan, B., Jia, X., Yu, J.X.

Πηγή: 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.

Συγγραφείς: 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

Πηγή: INFORMS Journal on Computing. Mar/Apr2026, Vol. 38 Issue 2, p377-396. 20p.

Θεματικοί όροι: *Scheduling, *Computer science, *Algorithms, *Mathematical optimization, Approximation algorithms, Computational complexity

Scheduling UAV-Based Deliveries With an Approximation Algorithm

Συγγραφείς: Attenni, G., Arrigoni, V., Finelli, M., Bartolini, N.

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

Improved Approximation Algorithms for the Expanding Search Problem

Συγγραφείς: Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior

Συνεισφορές: Svenja M. Griesbach and Felix Hommelsheim and Max Klimm and Kevin Schewior, Li Gortz, Inge, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz

Πηγή: 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

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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 the Maximum Multi-Commodity Service DAG Flow

Συγγραφείς: Li, Peng, Zhang, Jianan

Πηγή: 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.

Συγγραφείς: Liang, Wei¹ (AUTHOR) lvecho1019@zjnu.edu.cn, Tang, Shaojie² (AUTHOR) shaojiet@buffalo.edu, Zhang, Zhao¹ (AUTHOR) hxhzz@sina.com

Πηγή: Mathematical Programming. Sep2026, Vol. 219 Issue 1/2, p829-864. 36p.

Θεματικοί όροι: Approximation algorithms, Polynomial time algorithms, Graph theory, Applied sciences

Approximation Algorithm for Minimum Weight Sweep Coverage Without Predetermined Sinks

Συγγραφείς: Zhang, Weiguang, Liang, Jiarong

Πηγή: 2025 5th International Conference on Computer Science, Electronic Information Engineering and Intelligent Control Technology (CEI) Computer Science, Electronic Information Engineering and Intelligent Control Technology (CEI), 2025 5th International Conference on. :6-13 Nov, 2025

Relation: 2025 5th International Conference on Computer Science, Electronic Information Engineering and Intelligent Control Technology (CEI)

Approximation algorithm for the Min-Max partial tree cover problem.

Συγγραφείς: Zhao, Lei¹ (AUTHOR) zhaolei@zjnu.edu.cn, Zhang, Zhao¹ (AUTHOR) hxhzz@sina.com

Πηγή: Mathematical Methods of Operations Research. Jun2026, Vol. 103 Issue 1/2, p299-310. 12p.

Θεματικοί όροι: *Algorithms, *Mathematical optimization, Approximation algorithms, Weighted graphs, Graph theory

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

Συγγραφείς: Kumar, Rohit, Mukherjee, Joy Chandra

Πηγή: 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)

Approximation algorithm for the semitotal domination problem in unit disk graphs.

Συγγραφείς: Henning, Michael A.¹ (AUTHOR) mahenning@uj.ac.za, Mishra, Pawan K.^1,2 (AUTHOR) pawan@iiitg.ac.in, Sehgal, Kartik² (AUTHOR) kartik.sehgal22b@iiitg.ac.in, Tripathi, Shaurya M.² (AUTHOR) shaurya.tripathi22b@iiitg.ac.in, Tuli, Sridhar² (AUTHOR) sridhar.tuli22b@iiitg.ac.in

Πηγή: Discrete Applied Mathematics. Oct2026, Vol. 391, p317-327. 11p.

Θεματικοί όροι: *Dominating set, *Approximation algorithms, *NP-complete problems, *Intersection graph theory, *Independent sets, *Graph theory

Approximation algorithm for the fault-tolerant knapsack center problem

Συγγραφείς: Miao, Runjie^{Aff1, IDs1159002602303y_cor1}

Πηγή: Optimization Letters. 20(7):1457-1464

Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties

Συγγραφείς: Oh, Eunjin, Park, Seongbin, Song, Chanho

Θεματικοί όροι: Computational Geometry, Data Structures and Algorithms

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2609.26369