Skip to main content
SpringerLink
Log in

Algorithmic Aspects in Information and Management

15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Weili Wu

    1. The University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hongwei Du

    1. Harbin Institute of Technology, Shenzhen, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13153)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: AAIM 2021.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. Approximation Algorithms

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations

      • Wei Liang, Zhao Zhang
      Pages 3-14

    3. Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties

      • Sai Ji, Gaidi Li, Dongmei Zhang, Xianzhao Zhang
      Pages 15-26

    4. Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem

      • Yajie Li, Weidong Li, Xiaofei Liu, Jinhua Yang
      Pages 27-37

    5. An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem

      • Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu
      Pages 38-46

    6. On Stochastic k-Facility Location

      • Yicheng Xu, Chunlin Hao, Chenchen Wu, Yong Zhang
      Pages 47-56

    7. The Complexity of Finding a Broadcast Center

      • Hovhannes A. Harutyunyan, Zhiyuan Li
      Pages 57-70

    8. An Online Algorithm for Data Caching Problem in Edge Computing

      • Xinxin Han, Guichen Gao, Yang Wang, Yong Zhang
      Pages 71-80

  3. Scheduling

    1. Front Matter

      Pages 81-81
      Download chapter PDF

    2. Scheduling on Multiple Two-Stage Flowshops with a Deadline

      • Jianer Chen, Minjie Huang, Yin Guo
      Pages 83-95

    3. Single Machine Scheduling with Rejection to Minimize the Weighted Makespan

      • Lingfa Lu, Liqi Zhang, Jinwen Ou
      Pages 96-110

    4. Maximizing Energy Efficiency for Charger Scheduling of WRSNs

      • Yi Hong, Chuanwen Luo, Zhibo Chen, Xiyun Wang, Xiao Li
      Pages 111-122

    5. A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem

      • Yu Si, Suixiang Gao, Wenguo Yang
      Pages 123-133

    6. Optimizing Mobile Charger Scheduling for Task-Based Sensor Networks

      • Xiangguang Meng, Jianxiong Guo, Xingjian Ding, Xiujuan Zhang
      Pages 134-145

    7. Semi-online Early Work Maximization Problem on Two Hierarchical Machines with Partial Information of Processing Time

      • Man Xiao, Xiaoqiao Liu, Weidong Li
      Pages 146-156

  4. Nonlinear Combinatorial Optimization

    1. Front Matter

      Pages 157-157
      Download chapter PDF

    2. Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints

      • Bin Liu, Zihan Chen, Hongmin W. Du
      Pages 159-169

    3. Stochastic Submodular Probing with State-Dependent Costs

      • Shaojie Tang
      Pages 170-178

    4. Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint

      • Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
      Pages 179-189
Back to top

Other volumes

  1. Algorithmic Aspects in Information and Management

Keywords

About this book

This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. 

The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous. 

Editors and Affiliations

  • The University of Texas at Dallas, Richardson, USA

    Weili Wu

  • Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation