录用论文

  1. APX-Hardness of Quickest Flows with Davidson-Type Transit Times

    Siyuan Chen, Penghao Xiong, Suixiang Gao, Wenguo Yang

  2. A Recursive Preprocessing for Routing among Convex Polygonal Obstacles

    Siddharth Gaur, R. Inkulu

  3. Beyond Max and Sum: Compatibility of Two-Level Centrum Objectives

    Jijun Li, Yukun Cheng, Lu Han, Chenchen Wu, Yicheng Xu

  4. A Combinatorial Approximation Algorithm for Fault-Tolerant Facility Location with Heterogeneous Demands

    Wei Yue, Longkun Guo

  5. 5/3-Approximation Algorithms for the Ordered Clustered Rural Postman Problem

    Lingxiang Tang, Longkun Guo, Zhenhao Ni

  6. On Randomized Online Span Minimization

    Adrian Calinescu, Gruia Călinescu, Peng-Jun Wan

  7. Hardness of the parallel two-stage flowshops under a makespan constraint

    Jianming Dong, Weitian Tong, Yao Xu, Huili Zhang

  8. Differentially Private Partial-Monotone Adaptive Submodular Maximization under k-System Constraints

    Chensheng Ma, Mingchao Zhou, Hao Xiao, Wei Mao, Zhao Zhang

  9. Bicriteria Approximation for Arc-Disjoint Routing with a Shared-Vertex Budget

    Fengjuan Wang, Longkun Guo, Ruiqi Yang, Xiaoyan Zhang

  10. Approximation–Query Tradeoffs for Decomposed Weak-DR Maximization under a Matroid

    Xin Sun, Hao Wang

  11. Curvature-Aware GSEMO for Budgeted Sequence Submodular Maximization

    Yuanyuan Shi, Xin Sun, Shuai Wang, Yulan Lu, Xinhui Si

  12. Approximate Shortest Path Queries amid Convex Polygonal Obstacles

    Siddharth Gaur, R. Inkulu

  13. DiffuMARL-BSTO: A Hierarchical Diffusion-MARL Framework for Robotic Beam Selection and Trajectory Optimization

    Dongzhao Wang, Kang Wang, Yang Li, Ruijie Yang, Zhenning Zhang, Changjing Zhuge

  14. Approximation algorithms for the bisubmodular load balancing

    LiCai Shao, Xingong Zhang

  15. Improved Approximation Algorithms for the Maximum Weight k−-Path/Cycle Packing Problem in Complete Graphs

    Yuqiu He, Wei Yu, Zhaohui Liu

  16. Efficient Card-Based Multiplication Protocols for the Integer Encoding

    Kazumasa Shinagawa

  17. Approximations for the Min-Max Balanced Spanning 2-Forest Problem

    Zixin Qiao, Yong Chen, Xing Wang

  18. On the Vertex-Traversing-Constrained Windy Postman Problem

    Jianping Li, Runtao Xie, Wei Li, Xiaoxiao Yang, Hong Li

  19. Single-Machine Scheduling with Penalty and Learning Effects under Fair Constraints

    Guojun Hu, Anqi Zhao, Lanxin Xiao, Xiaoming Li

  20. Learning-augmented Multi-objective Resource Allocation for International Dry Port Management Using Public Operational Data

    Haiying Bao, Yafei Liu, Muhanmad Zulkiflee Osman, Junran Lichen

  21. Approximating the Rural Postman Problem below 3/2

    Hong Li, Jianping Li, Wei Li, Runtao Xie, Xiaoxiao Yang

  22. Maximum Matching-Match: Hardness and Approximation

    Dumitru Ilie, Adrian Miclăuş, Alexandru Popa

  23. The Optimal Diversity Management Problem under Budgeted Demand Uncertainty

    Thanh Loan Nguyen

  24. Robust Submodular Multiple-Path Orienteering Problem for Heterogeneous Robots under Budgeted Attacks

    Kang Wang, Yang Lv, Xiaoyun Tian, Yapu Zhang

  25. Forecast-Guided Courier Repositioning for Online Meal Delivery

    Yicheng Li, Yangbo Meng, Zihan Zhang, Min Wen

  26. Broadcast Domination Number is at Most Twice the Multipacking Number

    Sk Samim Islam

  27. On the Generalized 2-Assignment Problems

    Jianping Li, Wei Li, Hong Li, Runtao Xie, Xiaoxiao Yang

  28. On the Complexity of Hop Domination and 2-Step Domination in Graph Classes

    Sandip Das, Sweta Das, Sk Samim Islam

  29. Locating Hop and Locating 2-Step Domination in Some Graph Classes

    Sandip Das, Sweta Das, Sk Samim Islam

  30. TCN-Transformer-LSTM: Multiscale temporal feature learning for short-term water demand forecasting in district metered areas

    Geng Li, Zhigang Song, Jian Zhang, Jie Zeng, Chong Wang, Kejia Sun

  31. Approximation Algorithms for Roman Hitting Set

    Mengmeng He, Yaping Mao, Xiaoyan Zhang

  32. Temporal Replica Propagation with Tree-Convex Service Regions

    Guichen Gao, Xinxin Han, Yong Zhang

  33. Projected Gradient Methods for Maximizing Sums of DR-Submodular and Concave Functions

    Jiahe Wang, Zhicheng Liu, Ruiqi Yang, Vassilis Zissimopoulos

  34. Dominating broadcast in d-dimensional space

    Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam Manna Mitra, Bodhayan Roy

  35. Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound

    Sandip Das, Sk Samim Islam, Aashirwad Mohapatra, Sangita Saha, Saumya Sen

  36. A Bicriteria Approximation Algorithm for Min-Max UAV Flight Time in Data Collection

    Zhenhao Ni, Longkun Guo, Lingxiang Tang

  37. Approximation Algorithms and Lower Bounds for Facility Location with Opening Costs and Maximum Service Distance

    Mengzhen Li, Xiaoyun Tian, Dachuan Xu, Yapu Zhang

  38. Exact and Scalable Continuous k-Center for fixed k

    Stefan Funke, Sabine Storandt

  39. An Improved Distributed Algorithm for k-Center with Outliers

    Zahra Navidi, Hamid Zarrabi-Zadeh

  40. A Parameterized Approximation Algorithm for k-Center Clustering with Minimum Representation Fairness

    Meiyun Lu, Longkun Guo

  41. Convex Risk Allocation for Finite-Agent Markov Control with Capacity Constraints

    Guihao Wang, Dachuan Xu, Xingong Zhang, Yapu Zhang

  42. Prize-Collecting k-Sink on Dynamic Path Networks

    Guihao Wang, Jiahe Wang, Chenchen Wu, Yapu Zhang

  43. Pricing of Electric Vehicle Charging with Fairness-Oriented Incentives: A Potential Game Framework

    Zhongyang Zhao, Zhidan Feng, Chunying Ren, Xiaoyun Tian