Skip to main content
  • Conference proceedings
  • © 2014

Frontiers in Algorithmics

8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings

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

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

Conference series link(s): FAW: International Workshop on Frontiers in Algorithmics

Conference proceedings info: FAW 2014.

Buy it now

Buying options

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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (30 papers)

  1. Front Matter

  2. Contributed Papers

    1. Broadcast Problem in Hypercube of Trees

      • Puspal Bhabak, Hovhannes A. Harutyunyan
      Pages 1-12
    2. Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

      • David Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones
      Pages 48-59
    3. The Complexity of Zero-Visibility Cops and Robber

      • Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
      Pages 60-70
    4. Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem

      • Zhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu
      Pages 71-81
    5. Randomized Parameterized Algorithms for Co-path Set Problem

      • Qilong Feng, Qian Zhou, Shaohua Li
      Pages 82-93
    6. Monotone Grid Drawings of Planar Graphs

      • Md. Iqbal Hossain, Md. Saidur Rahman
      Pages 105-116
    7. Spanning Distribution Forests of Graphs

      • Keisuke Inoue, Takao Nishizeki
      Pages 117-127
    8. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations

      • Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu
      Pages 128-140
    9. Minimal Double Dominating Sets in Trees

      • Marcin Krzywkowski
      Pages 151-157
    10. Parallel-Machine Scheduling Problem under the Job Rejection Constraint

      • Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen
      Pages 158-169
    11. Approximation Algorithms on Consistent Dynamic Map Labeling

      • Chung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon
      Pages 170-181
    12. The PoA of Scheduling Game with Machine Activation Costs

      • Ling Lin, Yujie Yan, Xing He, Zhiyi Tan
      Pages 182-193
    13. Approximation Algorithms for Bandwidth Consecutive Multicolorings

      • Yuji Obata, Takao Nishizeki
      Pages 194-204

Other Volumes

  1. Frontiers in Algorithmics

About this book

This book constitutes the refereed proceedings of the 8th International Frontiers of Algorithmics Workshop, FAW 2014, held in Zhangjiajie, China, in June 2014. The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 65 submissions. They provide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatorial optimization and their applications.

Editors and Affiliations

  • Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  • Cornell University, USA

    John E. Hopcroft

  • School of Information Science and Engineering, Central South University, Changsha, China

    Jianxin Wang

Bibliographic Information

  • Book Title: Frontiers in Algorithmics

  • Book Subtitle: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings

  • Editors: Jianer Chen, John E. Hopcroft, Jianxin Wang

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-319-08016-1

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing Switzerland 2014

  • Softcover ISBN: 978-3-319-08015-4Published: 30 July 2014

  • eBook ISBN: 978-3-319-08016-1Published: 30 May 2014

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XVIII, 344

  • Number of Illustrations: 107 b/w illustrations

  • Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science

Buy it now

Buying options

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