Advertisement

Algorithmic Aspects in Information and Management

10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings

  • Qianping Gu
  • Pavol Hell
  • Boting Yang
Conference proceedings AAIM 2014

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

Table of contents

  1. Front Matter
    PDF

  2. Contributed Papers

    1. Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme
      Peter Brass, Hyeon-Suk Na, Chan-Su Shin
      Pages 1-12
    2. On the Exact Block Cover Problem
      Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu
      Pages 13-22
    3. Minimax Regret k-sink Location Problem in Dynamic Path Networks
      Guanqun Ni, Yinfeng Xu, Yucheng Dong
      Pages 23-31
    4. Competitive Algorithms for Unbounded One-Way Trading
      Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang
      Pages 32-43
    5. The Complexity of Degree Anonymization by Vertex Addition
      Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
      Pages 44-55
    6. Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints
      Yumei Huo
      Pages 56-65
    7. Edge-Clique Covers of the Tensor Product
      Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang
      Pages 66-74
    8. Protein Name Recognition Based on Dictionary Mining and Heuristics
      Shian-Hua Lin, Shao-Hong Ding, Wei-Sheng Zeng
      Pages 75-87
    9. A Facility Coloring Problem in 1-D
      Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel Smid
      Pages 88-99
    10. Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
      Daiki Hoshika, Eiji Miyano
      Pages 100-111
    11. The Garden Hose Complexity for the Equality Function
      Well Y. Chiu, Mario Szegedy, Chengu Wang, Yixin Xu
      Pages 112-123
    12. Finding Robust Minimum Cuts
      Barbara Geissmann, Rastislav Šrámek
      Pages 124-136
    13. A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case
      Hela Masri, Saoussen Krichen, Adel Guitouni
      Pages 137-148
    14. Multiple Sink Location Problems in Dynamic Path Networks
      Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
      Pages 149-161
    15. Narrowing the Complexity Gap for Colouring (Cs,Pt)-Free Graphs
      Shenwei Huang, Matthew Johnson, Daniël Paulusma
      Pages 162-173
    16. New Lower Bounds on Broadcast Function
      Hayk Grigoryan, Hovhannes A. Harutyunyan
      Pages 174-184
    17. Efficient Memoization for Approximate Function Evaluation over Sequence Arguments
      Tamal Biswas, Kenneth W. Regan
      Pages 185-196
    18. Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights
      Wei Ding, Guohui Lin
      Pages 197-207
    19. Obtaining Split Graphs by Edge Contraction
      Chengwei Guo, Leizhen Cai
      Pages 208-218
    20. Parameterized Complexity of Connected Induced Subgraph Problems
      Leizhen Cai, Junjie Ye
      Pages 219-230
    21. Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times
      Taibo Luo, Yinfeng Xu
      Pages 231-240
    22. Restricted Bipartite Graphs: Comparison and Hardness Results
      Tian Liu
      Pages 241-252
    23. The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks
      Fengmao Lv, Guowu Yang, Shuangbao Wang, Fuyou Fan
      Pages 253-262
    24. On P3-Convexity of Graphs with Bounded Degree
      Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza
      Pages 263-274
    25. The Competitive Diffusion Game in Classes of Graphs
      Elham Roshanbin
      Pages 275-287
    26. A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
      Mingyu Xiao
      Pages 288-298
    27. Clustering Performance of 3-Dimensional Hilbert Curves
      H. K. Dai, H. C. Su
      Pages 299-311
    28. Broadcast Networks with Near Optimal Cost
      Hovhannes A. Harutyunyan
      Pages 312-322
    29. An Optimal Context for Information Retrieval
      Rabeb Mbarek, Mohamed Tmar, Hawete Hattab
      Pages 323-330
    30. An Auction-Bargaining Model for Initial Emission Permits
      Lili Ding, Xiaoling Wang, Wanglin Kang
      Pages 331-340
  3. Back Matter
    PDF

About these proceedings

Introduction

This volume constitutes the proceedings of the International Conference on Algorithmic Aspects in Information and Management, AAIM 2014, held in Vancouver, BC, Canada, in July 2014.

The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications.

Keywords

combinatorics computational complexity data structures discrete algorithms discrete mathematics graph algorithms analysis graph coloring graph theory online algorithms operations research parameterized algorithms theory of computation

Editors and affiliations

  • Qianping Gu
    • 1
  • Pavol Hell
    • 1
  • Boting Yang
    • 2
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.Department of Computer ScienceUniversity of ReginaReginaCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-07956-1
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-07955-4
  • Online ISBN 978-3-319-07956-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Energy, Utilities & Environment
Engineering