Skip to main content
  • Conference proceedings
  • © 2011

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings

  • State-of-the-art research

  • Fast-track conference proceedings

  • Unique visibility

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

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

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (39 papers)

  1. Front Matter

  2. Contributed Papers

    1. The k-Canadian Travelers Problem with Communication

      • Huili Zhang, Yinfeng Xu
      Pages 17-28
    2. An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem

      • Zhong Li, Randy Goebel, Lusheng Wang, Guohui Lin
      Pages 46-57
    3. Greedy Routing via Embedding Graphs onto Semi-metric Spaces

      • Huaming Zhang, Swetha Govindaiah
      Pages 58-69
    4. On Variants of the Spanning Star Forest Problem

      • Jing He, Hongyu Liang
      Pages 70-81
    5. An Implicit Degree Condition for Cyclability in Graphs

      • Hao Li, Wantao Ning, Junqing Cai
      Pages 82-89
    6. Parallel Enumeration of Lattice Animals

      • Gadi Aleksandrowicz, Gill Barequet
      Pages 90-99
    7. Parameterized Edge Dominating Set in Cubic Graphs

      • Mingyu Xiao, Hiroshi Nagamochi
      Pages 100-112
    8. On Some Geometric Problems of Color-Spanning Sets

      • Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu
      Pages 113-124
    9. An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs

      • Edita Máčajová, Ján Mazák
      Pages 136-146
    10. Complexity of Total {k}-Domination and Related Problems

      • Jing He, Hongyu Liang
      Pages 147-155
    11. The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View

      • Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo
      Pages 156-167

About this book

This book constitutes the joint refereed proceedings of the 5th International Frontiers of Algorithmics Workshop, FAW 2011, and the 7th International Conference on Algorithmic Aspects in Information and Management, AAIM 2011, jointly held in Jinhua, China, in May 2011. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 92 submissions. The papers cover a wide range of topics in the areas of algorithmics, combinatorial optimization and their applications presenting current trends of research.

Keywords

  • algorithm analysis
  • algorithm complexity
  • algorithmic scheduling
  • computational complexity
  • computational graph theory
  • graph algorithms
  • online algorithms
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Department of Computer Science, Purdue University, West Lafayette, USA

    Mikhail Atallah

  • Department of Computer Science, Illinois Institute of Technology, Chicago, USA

    Xiang-Yang Li

  • Department of Computer Science, Montana State University, Bozeman, USA

    Binhai Zhu

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions