Submodular Maximization under k-System Constraints in Parallel: A Trifecta of Approximation, Adaptivity, and Query Complexity

Authors: Cui, Shuang, Sun, Yu-e, Huang, He

Source: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1. :164-175

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

A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection

Authors: Chekuri, Chandra, Jain, Rhea

Source: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :2230-2241

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

Optimizing the Weight Stable Set Attack With Budget Constraint

Authors: Sun, R., Li, W.

Source: IEEE Transactions on Dependable and Secure Computing IEEE Trans. Dependable and Secure Comput. Dependable and Secure Computing, IEEE Transactions on. 23(4):9426-9439 Aug, 2026

MicroEdge: An Online Optimization Framework for Cost-Efficient Microservice Orchestration in Edge Native Applications

Authors: Zeng, W., Zhao, K., Liao, J., Zhou, Z., Guo, D., Chen, X.

Source: IEEE Transactions on Mobile Computing IEEE Trans. on Mobile Comput. Mobile Computing, IEEE Transactions on. 25(6):7472-7489 Jun, 2026

Minimum-Cost Charger Deployment for Long-Running Multitask Applications in Large-Scale Sensor Networks

Authors: Xu, L., Chai, L., Pang, T., Zhai, X., Zhang, J., Xu, J.

Source: IEEE Transactions on Mobile Computing IEEE Trans. on Mobile Comput. Mobile Computing, IEEE Transactions on. 25(6):7748-7765 Jun, 2026

Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits

Authors: Huang, M., Guan, J., Fang, W., Ying, M.

Source: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on. 45(6):2679-2692 Jun, 2026

ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast

Authors: Xu, Yimeng, Zhou, Minyuan, Wang, Congying, Zheng, Jiaqi, Hao, Shuai, Chen, Guihai, Wu, Jie

Source: IEEE INFOCOM 2026 - IEEE Conference on Computer Communications Computer Communications, IEEE INFOCOM 2026 - IEEE Conference on. :1-10 May, 2026

Relation: IEEE INFOCOM 2026 - IEEE Conference on Computer Communications

Fault-Tolerant Offloading Framework for Real-Time Applications in Mobile Edge Computing

Authors: Gao, Chuanchao, Gao, Yiyang, Yuhas, Michael, Easwaran, Arvind

Source: 2026 IEEE 32nd Real-Time and Embedded Technology and Applications Symposium (RTAS) RTAS Real-Time and Embedded Technology and Applications Symposium (RTAS), 2026 IEEE 32nd. :208-221 May, 2026

Relation: 2026 IEEE 32nd Real-Time and Embedded Technology and Applications Symposium (RTAS)

Practical Group Steiner Tree Algorithms for Web Applications with Many Groups

Authors: Shan, Qicheng, Yang, Yuxuan, Cheng, Gong

Source: Proceedings of the ACM Web Conference 2026. :765-776

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

Position Auctions in AI-Generated Content

Authors: Balseiro, Santiago, Bhawalkar, Kshipra, Deng, Yuan, Feng, Zhe, Mao, Jieming, Mehta, Aranyak, Mirrokni, Vahab, Paes Leme, Renato, Wang, Di, Zuo, Song

Source: Proceedings of the ACM Web Conference 2026. :261-272

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

Online Advertising with Spatial Interactions

Authors: Aggarwal, Gagan, Wang, Yifan, Zhao, Mingfei

Source: Proceedings of the ACM Web Conference 2026. :213-224

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

A Class of Convex Optimization-Based Recursive Algorithms for Identification of Stochastic Systems

Authors: Ding, M., Zhao, W., Chen, T., Zhang, W.

Source: IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 71(4):2496-2511 Apr, 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

An Improved Greedy Approximation for (Metric) k-Means

Authors: Charikar, Moses, Cohen-Addad, Vincent, Gao, Ruiquan, Grandoni, Fabrizio, Le, Euiwoong, Van Wijland, Ernest

Source: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :233-240 Dec, 2025

Relation: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)

Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest

Authors: Ahmadi, Ali, Gholami, Iman, Hajiaghayi, MohammadTaghi, Jabbarzade, Peyman, Mahdavi, Mohammad

Source: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :373-444 Dec, 2025

Relation: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)

Joint RIS Assignment and Entanglement Distribution With Purification in FSO-Based Quantum Networks

Authors: Yang, Chun-An, Chang, Yung-Hsiang, Du, Jing-Jhih, Le Touze, Juliette Chou, Kuo, Jian-Jhih, Wang, Chih-Yu, Tsai, Ming-Jer

Source: GLOBECOM 2025 - 2025 IEEE Global Communications Conference Global Communications Conference, GLOBECOM 2025 - 2025 IEEE. :2240-2245 Dec, 2025

Relation: GLOBECOM 2025 - 2025 IEEE Global Communications Conference

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing

Authors: Gao, Chuanchao, Easwaran, Arvind

Source: 2025 IEEE Real-Time Systems Symposium (RTSS) RTSS Real-Time Systems Symposium (RTSS), 2025 IEEE. :175-188 Dec, 2025

Relation: 2025 IEEE Real-Time Systems Symposium (RTSS)

Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces

Authors: Kowaluk, Miroslaw, Author, Lingas, Andrzej, Author, Persson, Mia, Author

Contributors: Kowaluk, Miroslaw, Author, Lingas, Andrzej, Author, Persson, Mia, Author

Source: Algorithms. 19(3)

Subject Terms: ℓ2 distance, Euclidean space, Hamming distance, Hamming space, clustering, approximation algorithm, time complexity

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-83581
https://doi.org/10.3390/a19030243

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization

Authors: Jadav, Hareshkumar, Singh, Ranveer, Aggarwal, Vaneet

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

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

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms

Authors: Jia, He, Laddha, Aditi, Lee, Yin Tat, Vempala, Santosh

Source: Journal of the ACM. 73(2):1-21

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