Skip to main content
SpringerLink
Log in

Frontiers in Algorithmics

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

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Jianer Chen

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. John E. Hopcroft

    1. Cornell University, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jianxin Wang

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

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

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

Included in the following conference series:

Conference proceedings info: FAW 2014.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

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.

Similar content being viewed by others

Keywords

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. Contributed Papers

    1. Broadcast Problem in Hypercube of Trees

      • Puspal Bhabak, Hovhannes A. Harutyunyan
      Pages 1-12

    2. Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time

      • Yixin Cao
      Pages 13-24

    3. A Fixed-Parameter Approach for Privacy-Protection with Global Recoding

      • Katrin Casel
      Pages 25-35

    4. A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy

      • Danny Z. Chen, David Craft, Lin Yang
      Pages 36-47

    5. Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

      • David Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones
      Pages 48-59

    6. The Complexity of Zero-Visibility Cops and Robber

      • Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
      Pages 60-70

    7. Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem

      • Zhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu
      Pages 71-81

    8. Randomized Parameterized Algorithms for Co-path Set Problem

      • Qilong Feng, Qian Zhou, Shaohua Li
      Pages 82-93

    9. Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem

      • Longkun Guo
      Pages 94-104

    10. Monotone Grid Drawings of Planar Graphs

      • Md. Iqbal Hossain, Md. Saidur Rahman
      Pages 105-116

    11. Spanning Distribution Forests of Graphs

      • Keisuke Inoue, Takao Nishizeki
      Pages 117-127

    12. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations

      • Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu
      Pages 128-140

    13. Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time

      • Hwee Kim, Yo-Sub Han
      Pages 141-150

    14. Minimal Double Dominating Sets in Trees

      • Marcin Krzywkowski
      Pages 151-157

    15. Parallel-Machine Scheduling Problem under the Job Rejection Constraint

      • Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen
      Pages 158-169

    16. Approximation Algorithms on Consistent Dynamic Map Labeling

      • Chung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon
      Pages 170-181

    17. The PoA of Scheduling Game with Machine Activation Costs

      • Ling Lin, Yujie Yan, Xing He, Zhiyi Tan
      Pages 182-193

    18. Approximation Algorithms for Bandwidth Consecutive Multicolorings

      • Yuji Obata, Takao Nishizeki
      Pages 194-204

    19. Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees

      • Feng Shi, Jie You, Qilong Feng
      Pages 205-215
Back to top

Other volumes

  1. Frontiers in Algorithmics

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

Publish with us

Policies and ethics

Back to top

Search

Navigation