default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th AAIM 2022: Guangzhou, China
- Qiufen Ni
, Weili Wu:
Algorithmic Aspects in Information and Management - 16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings. Lecture Notes in Computer Science 13513, Springer 2022, ISBN 978-3-031-16080-6
Approximation Algorithms
- Shuyang Gu, Chuangen Gao, Weili Wu:
A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization. 3-14 - Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu:
An Approximation Algorithm for the Clustered Path Travelling Salesman Problem. 15-27 - Bo Hou, Zhenzhen Pang, Suogang Gao, Wen Liu:
Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP. 28-32
Scheduling Problem and Game Theory
- Ruiqing Sun, Xiaofei Liu:
Approximation Scheme for Single-Machine Rescheduling with Job Delay and Rejection. 35-45 - Man Xiao, Xihua Bai, Weidong Li:
Online Early Work Maximization Problem on Two Hierarchical Machines with Buffer or Rearrangements. 46-54 - Xiaofei Liu, Yaoyu Zhu, Weidong Li, Lei Ma:
On-line Single Machine Scheduling with Release Dates and Submodular Rejection Penalties. 55-65 - Quan-Lin Li, Yi-Meng Li, Jing-Yu Ma, Heng-Li Liu:
The Optimal Dynamic Rationing Policy in the Stock-Rationing Queue. 66-82 - Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang:
The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. 83-95 - Ling Gai, Mengpei Liang, Chenhao Wang:
Obnoxious Facility Location Games with Candidate Locations. 96-105
Nonlinear Combinatorial Optimization
- Shaojie Tang, Jing Yuan:
Streaming Adaptive Submodular Maximization. 109-120 - Shaojie Tang:
Constrained Stochastic Submodular Maximization with State-Dependent Costs. 121-132 - Mengxue Geng, Shufang Gong, Bin Liu, Weili Wu:
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. 133-143 - Jingwen Chen, Zhongzheng Tang, Chenhao Wang:
Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. 144-155 - Kemin Yu, Min Li, Yang Zhou, Qian Liu:
Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. 156-167
Network Problems
- Xiaojia Xu, Yongcai Wang, Yu Zhang, Deying Li:
Defense of Scapegoating Attack in Network Tomography. 171-182 - Liman Du, Wenguo Yang, Suixiang Gao:
Adaptive Competition-Based Diversified-Profit Maximization with Online Seed Allocation. 183-194 - Zichen Wang, Hongwei Du:
Collaborative Service Caching in Mobile Edge Nodes. 195-206 - Jianxiong Guo, Qiufen Ni, Xingjian Ding:
A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing. 207-218 - Qiufen Ni, Jianxiong Guo:
Profit Maximization for Multiple Products in Community-Based Social Networks. 219-230 - Wanting Li, Yongcai Wang, Deying Li, Xiaojia Xu:
MCM: A Robust Map Matching Method by Tracking Multiple Road Candidates. 231-243 - Shuchen Wang, Suixiang Gao, Wenguo Yang:
Pilot Pattern Design with Branch and Bound in PSA-OFDM System. 244-254 - Chuanwen Luo, Yunan Hou, Yi Hong, Zhibo Chen, Ning Liu, Deying Li:
AoI Minimizing of Wireless Rechargeable Sensor Network Based on Trajectory Optimization of Laser-Charged UAV. 255-267 - Huan Lan:
Energy-Constrained Geometric Coverage Problem. 268-277 - Yunlong Cheng, Hao Zhou, Xiaofeng Gao, Jiaqi Zheng, Guihai Chen:
Incremental SDN Deployment to Achieve Load Balance in ISP Networks. 278-290
Graph Theory
- Peng Li, Aifa Wang:
Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs. 293-302 - Xiaofeng Gu, William Zhang:
Cyclically Orderable Generalized Petersen Graphs. 303-315 - Yuehua Bu, Ruiying Yang, Hongguo Zhu:
The r-Dynamic Chromatic Number of Planar Graphs Without Special Short Cycles. 316-326 - Yi Tian, Na Kang, Weili Wu, Ding-Zhu Du, Suogang Gao:
Distance Magic Labeling of the Halved Folded n-Cube. 327-338 - Zhengxi Yang, Zhipeng Jiang, Wenguo Yang, Suixiang Gao:
Balanced Graph Partitioning Based on Mixed 0-1 Linear Programming and Iteration Vertex Relocation Algorithm. 339-350 - Qingzhen Dong, Xianyue Li, Yu Yang:
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance. 351-362 - Na Kang, Zhiquan Li, Lihang Hou, Jing Qu:
Mixed Metric Dimension of Some Plane Graphs. 363-375 - Zian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao:
On the Transversal Number of k-Uniform Connected Hypergraphs. 376-387 - Bei Niu, Xin Zhang:
An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs. 388-393 - Yuan Xue, Boting Yang, Sandra Zilles:
Fast Searching on k-Combinable Graphs. 394-405 - Yan Li, Ye Wang:
Class Ramsey Numbers Involving Induced Graphs. 406-412 - Yuehua Bu, Wenwen Chen, Junlei Zhu:
Injective Edge Coloring of Power Graphs and Necklaces. 413-420 - Liting Wang, Huijuan Wang:
Total Coloring of Planar Graphs Without Some Adjacent Cycles. 421-432
Logic and Machine Learning
- Hongliang Zhang, Jiguo Yu, Biwei Yan, Ming Jing, Jianli Zhao:
Security on Ethereum: Ponzi Scheme Detection in Smart Contract. 435-443 - Zekun Lu, Qiancheng Yu, Xiaofeng Wang, Xiaoning Li:
Learning Signed Network Embedding via Muti-attention Mechanism. 444-455 - Jiarui Wang, Nan Zhang, Zhenhua Duan:
Three Algorithms for Converting Control Flow Statements from Python to XD-M. 456-465 - Haobin Luo, Guowei Su, Yi Wang, Jiajia Zhang, Luobing Dong:
Hyperspectral Image Reconstruction for SD-CASSI Systems Based on Residual Attention Network. 466-475
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-11-14 21:09 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:
