A Constant-Approximation Algorithm for Budgeted Sweep Coverage With Mobile Sensors

Συγγραφείς: Liang, W., Tang, S., Zhang, Z.

Πηγή: IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:1777-1788 2026

Approximation Algorithm for Minimum Weight (2,m)-Connected Dominating Set

Συγγραφείς: Zhou, J., Cai, Z., Huang, X., Zhang, Y., Zhang, Z.

Πηγή: IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:6245-6256 2026

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 fault-tolerant knapsack center problem

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

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

An improved SDP rounding approximation algorithm for the max hypergraph bisection

Συγγραφείς: Li, Guangfeng^Aff1, Gutin, Gregory Z.^{Aff2, Aff3}, Han, Deren^Aff4, Sun, Jian^Aff5, Zhang, Xiaoyan^{Aff1, IDs1142502525060_cor1}

Πηγή: Science China Mathematics. 69(9):2515-2536

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

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

Συγγραφείς: Liang, Wei^Aff1, Tang, Shaojie^Aff2, Zhang, Zhao^{Aff1, IDs10107025022754_cor1}

Πηγή: Mathematical Programming: A Publication of the Mathematical Optimization Society. 219(12):829-864

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

Συγγραφείς: Békési, József^{Aff1, IDs10479026072613_cor1}, Dósa, György^Aff2, Galambos, Gábor^Aff3

Πηγή: Annals of Operations Research. 362(13):1-26

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

Συγγραφείς: Chacko, K., Alizadeh, M.I., Capitanescu, F., Li, P.

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

POCA: Partial Offloading with One-Climb Approximation Algorithm

Συγγραφείς: Fang, Yuchao, Pang, Yuheng, Gao, He, Xu, Duo

Πηγή: 2026 IEEE 4th International Conference on Control, Electronics and Computer Technology (ICCECT) Control, Electronics and Computer Technology (ICCECT), 2026 IEEE 4th International Conference on. :38-42 Apr, 2026

Relation: 2026 IEEE 4th International Conference on Control, Electronics and Computer Technology (ICCECT)

A combinatorial approximation algorithm for the multi-machine client order scheduling with packaging time and submodular rejection penalties

Συγγραφείς: Zheng, Xiya, Yu, Lixing, Wang, Wencheng, Liu, Xiaofei

Πηγή: 2025 China Automation Congress (CAC) China Automation Congress (CAC), 2025. :93-96 Sep, 2025

Relation: 2025 China Automation Congress (CAC)

A Better-Than-$3$ Approximation Algorithm for Demand Matching via Knapsack Intersection LP and Contention Resolution

Συγγραφείς: Goemans, Michel X., Pan, Yuchong

Θεματικοί όροι: Data Structures and Algorithms, Discrete Mathematics, Combinatorics

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

A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane

Συγγραφείς: de Berg, Sarita, Conradi, Jacobus, Kramer, Peter, Nusser, André, Wong, Sampson

Θεματικοί όροι: Computational Geometry

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

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

A short proof and experimental study of the approximation algorithm for label s-t cut

Συγγραφείς: Zhang, Peng^{Aff1, IDs1087802601463y_cor1}

Πηγή: Journal of Combinatorial Optimization. 52(2)

Approximation Algorithm for Minimum p Union under a Geometric Setting

Συγγραφείς: Ran, Ying-Li^{Aff1, IDs40305026006864_cor1}, Zhang, Zhao^{Aff1, IDs40305026006864_cor2}

Πηγή: Journal of the Operations Research Society of China. :1-22

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

A (2+ε)-Approximation Algorithm for Metric 𝑘-Median

Συγγραφείς: Cohen-Addad, Vincent, Grandoni, Fabrizio, Lee, Euiwoong, Schwiegelshohn, Chris, Svensson, Ola

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :615-624

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

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

An Approximation Algorithm for Non-uniform Non-contiguous Translocation Distance

Συγγραφείς: Constantin, Maria, Miclăuş, Adrian, Popa, Alexandru

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

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