Skip to main content
SpringerLink
Log in
Book cover

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Mikhail Atallah

    1. Department of Computer Science, Purdue University, West Lafayette, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xiang-Yang Li

    1. Department of Computer Science, Illinois Institute of Technology, Chicago, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Binhai Zhu

    1. Department of Computer Science, Montana State University, Bozeman, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

  1. Front Matter

    Download chapter PDF

  3. Contributed Papers

    1. Approximation Algorithm for the Uniform Bounded Facility Problem

      • Kerui Weng
      Pages 10-16

    2. The k-Canadian Travelers Problem with Communication

      • Huili Zhang, Yinfeng Xu
      Pages 17-28

    3. An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem

      • Wenqiang Dai, Yi Feng
      Pages 29-35

    4. Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs

      • Wenchang Luo, Lin Chen
      Pages 36-45

    5. An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem

      • Zhong Li, Randy Goebel, Lusheng Wang, Guohui Lin
      Pages 46-57

    6. Greedy Routing via Embedding Graphs onto Semi-metric Spaces

      • Huaming Zhang, Swetha Govindaiah
      Pages 58-69

    7. On Variants of the Spanning Star Forest Problem

      • Jing He, Hongyu Liang
      Pages 70-81

    8. An Implicit Degree Condition for Cyclability in Graphs

      • Hao Li, Wantao Ning, Junqing Cai
      Pages 82-89

    9. Parallel Enumeration of Lattice Animals

      • Gadi Aleksandrowicz, Gill Barequet
      Pages 90-99

    10. Parameterized Edge Dominating Set in Cubic Graphs

      • Mingyu Xiao, Hiroshi Nagamochi
      Pages 100-112

    11. On Some Geometric Problems of Color-Spanning Sets

      • Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu
      Pages 113-124

    12. Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere

      • Xuehou Tan, Gangshan Wu
      Pages 125-135

    13. An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs

      • Edita Máčajová, Ján Mazák
      Pages 136-146

    14. Complexity of Total {k}-Domination and Related Problems

      • Jing He, Hongyu Liang
      Pages 147-155

    15. The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View

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

Keywords

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.

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

Publish with us

Policies and ethics

Back to top

Search

Navigation