Skip to main content
SpringerLink
Log in

Algorithmic Aspects in Information and Management

14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Zhao Zhang

    1. Zhejiang Normal University, Jinhua, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Wei Li

    1. Texas Southern University, Houston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ding-Zhu Du

    1. University of Texas at Dallas, Richardson, USA

    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 12290)

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

Included in the following conference series:

Conference proceedings info: AAIM 2020.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (56 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Polynomial-Time Algorithms for the Touring Rays and Related Problems

    • Xuehou Tan
    Pages 1-12

  3. Polyhedral Circuits and Their Applications

    • Bin Fu, Pengfei Gu, Yuming Zhao
    Pages 13-24

  4. Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation

    • Yijing Wang, Dachuan Xu, Donglei Du, Ran Ma
    Pages 25-36

  5. Approximation Algorithm for Stochastic Set Cover Problem

    • Haiyun Sheng, Donglei Du, Yuefang Sun, Jian Sun, Xiaoyan Zhang
    Pages 37-48

  6. On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane \(\mathbb {R}^2\)

    • Junran Lichen, Jianping Li, Wencheng Wang, Jean Yeh, YeongNan Yeh, Xingxing Yu et al.
    Pages 49-61

  7. Minimum Diameter Vertex-Weighted Steiner Tree

    • Wei Ding, Ke Qiu
    Pages 62-72

  8. Community-Based Rumor Blocking Maximization in Social Networks

    • Qiufen Ni, Jianxiong Guo, Chuanhe Huang, Weili Wu
    Pages 73-84

  9. Improved Hardness and Approximation Results for Single Allocation Hub Location

    • Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang
    Pages 85-96

  10. Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs

    • Sai Ji, Dachuan Xu, Donglei Du, Ling Gai
    Pages 97-107

  11. 2-Level Station Location for Bike Sharing

    • Fengmin Wang, Xiaodong Hu, Chenchen Wu
    Pages 108-118

  12. Approximation Algorithms for the Lower-Bounded Knapsack Median Problem

    • Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang
    Pages 119-130

  13. The Spherical k-means++ Algorithm via Local Search

    • Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai
    Pages 131-140

  14. Local Search Algorithm for the Spherical k-Means Problem with Outliers

    • Yishui Wang, Chenchen Wu, Dongmei Zhang, Juan Zou
    Pages 141-148

  15. A Bi-criteria Analysis for Fuzzy C-means Problem

    • Yang Zhou, Jianxin Liu, Min Li, Qian Liu
    Pages 149-160

  16. Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph

    • Peng Zhang, Zhendong Liu
    Pages 161-172

  17. Online BP Functions Maximization

    • Ling Chen, Zhicheng Liu, Hong Chang, Donglei Du, Xiaoyan Zhang
    Pages 173-184

  18. Adaptive Robust Submodular Optimization and Beyond

    • Shaojie Tang, Jing Yuan
    Pages 185-194

  19. Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint

    • Min Cui, Dachuan Xu, Longkun Guo, Dan Wu
    Pages 195-203

  20. Fast Algorithms for Maximizing Monotone Nonsubmodular Functions

    • Bin Liu, Miaomiao Hu
    Pages 204-213
Back to top

Other volumes

  1. Algorithmic Aspects in Information and Management

Keywords

About this book

This volume constitutes the proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management, AAIM 2020, held in Jinhua, China in August 2020.
The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world applications associated with information and management analysis, modeling and data mining. Special considerations are given to algorithmic research that was motivated by real-world applications.

Editors and Affiliations

  • Zhejiang Normal University, Jinhua, China

    Zhao Zhang

  • Texas Southern University, Houston, USA

    Wei Li

  • University of Texas at Dallas, Richardson, USA

    Ding-Zhu Du

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation