Skip to main content
SpringerLink
Log in

Algorithmic Aspects in Information and Management

13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Ding-Zhu Du

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Lian Li

    1. Hefei University of Technology, Hefei, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Xiaoming Sun

    1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Jialin Zhang

    1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 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 11640)

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

Included in the following conference series:

Conference proceedings info: AAIM 2019.

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 (31 papers)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. One-Dimensional r-Gathering Under Uncertainty

    • Shareef Ahmed, Shin-ichi Nakano, Md. Saidur Rahman
    Pages 1-15

  3. Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees

    • Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
    Pages 16-28

  4. A Probabilistic Algorithm for Verification of Geometric Theorems

    • Mingyan Chen, Zhenbing Zeng
    Pages 29-41

  5. Approximating Closest Vector Problem in \(\ell _\infty \) Norm Revisited

    • Wenbin Chen, Jianer Chen
    Pages 42-50

  6. Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable

    • Wei Ding
    Pages 51-61

  7. Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs

    • Wei Ding, Ke Qiu
    Pages 62-71

  8. Updating Matrix Polynomials

    • Wei Ding, Ke Qiu
    Pages 72-82

  9. On the Structure of Discrete Metric Spaces Isometric to Circles

    • Andreas W. M. Dress, Hiroshi Maehara, Sabrina Xing Mei Pang, Zhenbing Zeng
    Pages 83-94

  10. A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling

    • Qilong Feng, Xiangzhong Meng, Guanlan Tan, Jianxin Wang
    Pages 95-107

  11. Profit Parameterizations of Dominating Set

    • Henning Fernau, Ulrike Stege
    Pages 108-120

  12. Exponential Time Approximation Scheme for TSP

    • Zhixiang Chen, Qilong Feng, Bin Fu, Mugang Lin, Jianxin Wang
    Pages 121-128

  13. Interaction-Aware Influence Maximization and Iterated Sandwich Method

    • Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, Dachuan Xu
    Pages 129-141

  14. On Approximation Algorithm for the Edge Metric Dimension Problem

    • Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao
    Pages 142-148

  15. The Seeding Algorithm for Spherical k-Means Clustering with Penalties

    • Sai Ji, Dachuan Xu, Longkun Guo, Min Li, Dongmei Zhang
    Pages 149-158

  16. Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes

    • Sai Ji, Dachuan Xu, Min Li, Yishui Wang
    Pages 159-168

  17. Two-Way Currency Trading Algorithms in the Discrete Setting

    • Fei Li
    Pages 169-178

  18. Approximation Algorithms for the Minimum Power Partial Cover Problem

    • Menghong Li, Yingli Ran, Zhao Zhang
    Pages 179-191

  19. On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length

    • Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
    Pages 192-202

  20. A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties

    • Xiaofei Liu, Weidong Li
    Pages 203-211
Back to top

Other volumes

  1. Algorithmic Aspects in Information and Management

Keywords

About this book

This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.

The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications. 

Editors and Affiliations

  • The University of Texas at Dallas, Richardson, USA

    Ding-Zhu Du

  • Hefei University of Technology, Hefei, China

    Lian Li

  • Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun, Jialin Zhang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation