default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th AAIM 2024: Virtual Event - Part I
- Smita Ghosh
, Zhao Zhang:
Algorithmic Aspects in Information and Management - 18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15179, Springer 2024, ISBN 978-981-97-7797-6
Optimization and Applications
- Xiaowei Lv, Yongcai Wang, Deying Li, Haodi Ping:
Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs. 3-15 - Luchuan Zeng, Kunming Jin, Zichen Wang, Chen Zhang, Hongwei Du:
NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm. 16-27 - Yuxuan Xu, Yingli Ran, Zhao Zhang:
Approximation Algorithm for the Maximum Interval Multi-cover Problem. 28-34 - Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn:
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. 35-47 - Fenghe Xia, Longkun Guo, Xiaoyan Zhang:
Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs. 48-59 - Zhikang Zhang, Weidong Li:
Cost-Sharing Mechanisms for the Selfish Open-End Bin Packing Problem. 60-71 - Qing Zhao, Zhen Li, Jianqiang Li, Jianxiong Guo, Xingjian Ding, Deying Li:
ToI-Based Data Utility Maximization for UAV-Assisted Wireless Sensor Networks. 72-83 - Xinlan Xia, Lu Han, Lili Mei:
Parity-Constrained Weighted k-Center. 84-93 - Zhidan Feng, Henning Fernau, Binhai Zhu:
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. 94-108 - Yuanyuan Qiang, Bin Liu:
Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice. 109-121 - Limin Wang, Zhao Zhang, Donglei Du, Yaping Mao, Xiaoyan Zhang:
A Distributed Approximation Algorithm for the Total Dominating Set Problem. 122-132 - Mengzhen Li, Runjie Miao, Chenchen Wu, Dachuan Xu:
Revisit the Online Facility Location Problem with Uniform Facility Cost. 133-144 - Haifeng Huang, Qian Liu, Yang Zhou, Min Li:
or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint. 145-156 - Ruidong Yan, Zhenhua Guo, Weili Wu, Baoyu Fan:
A Distributed Method for Negative Content Spread Minimization on Social Networks. 157-169 - Yaqi Li, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem. 170-181 - Ruiqing Sun:
Iterative Rounding for Bag of Tasks Scheduling with Rejection in High Performance Computing. 182-193
Submodularity, Management and Others
- Cong Li, Suixiang Gao, Wenguo Yang, Zhipeng Jiang:
Integrated Airline Aircraft Routing and Crew Pairing by Alternating Lagrangian Decomposition. 197-209 - Shufang Gong, Bin Liu, Qizhi Fang, Weili Wu:
Monotone Submodular Meta-learning under the Matroid Constraint. 210-221 - Jing Yuan, Shaojie Tang:
Submodular Participatory Budgeting. 222-234 - Weijia Hu, Bin Liu:
Approximation Algorithms for k-Submodular Maximization Under the Fair Constraints and Size Constraints. 235-246 - Hongmin W. Du, Jiahui Xu, Miklos A. Vasarhelyi:
Systematic Review of Cybersecurity Disclosure Research. 247-262 - Xuehou Tan, Rong Chen, Qing Jiang:
Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position. 263-273 - Keqin Chen, Zhipeng Jiang:
Transition-Based Heterogeneous Network Embedding by Self-attention Model of Sparse Matrix. 274-285
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-29 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
