Skip to main content
SpringerLink
Log in

Algorithmic Aspects in Information and Management

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

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Qianping Gu

    1. School of Computing Science, Simon Fraser University, Burnaby, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pavol Hell

    1. School of Computing Science, Simon Fraser University, Burnaby, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Boting Yang

    1. Department of Computer Science, University of Regina, Regina, Canada

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

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

Included in the following conference series:

Conference proceedings info: AAIM 2014.

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

  1. Front Matter

    Download chapter 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 (C s ,P t )-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
Back to top

Other volumes

  1. Algorithmic Aspects in Information and Management

Keywords

About this book

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.

Editors and Affiliations

  • School of Computing Science, Simon Fraser University, Burnaby, Canada

    Qianping Gu, Pavol Hell

  • Department of Computer Science, University of Regina, Regina, Canada

    Boting Yang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation