Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Frontiers in Algorithmics

9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Jianxin Wang

    1. Central South University, Changsha, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Chee Yap

    1. Courant Institute, New York University, New York, USA

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

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

Included in the following conference series:

Conference proceedings info: FAW 2015.

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
¥17,985 /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 JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • 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 proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015.

The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.

Similar content being viewed by others

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Graph Modification Problems: A Modern Perspective

      • Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
      Pages 3-6

    3. Soft Subdivision Search in Motion Planning, II: Axiomatics

      • Chee K. Yap
      Pages 7-22

  3. Contributed Papers

    1. Front Matter

      Pages 23-23
      Download chapter PDF

    2. On r-Gatherings on the Line

      • Toshihiro Akagi, Shin-ichi Nakano
      Pages 25-32

    3. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow

      • Jie Cheng, Daming Zhu, Binhai Zhu
      Pages 33-44

    4. Efficient Computation of the Characteristic Polynomial of a Threshold Graph

      • Martin Fürer
      Pages 45-51

    5. A Fast and Practical Method to Estimate Volumes of Convex Polytopes

      • Cunjing Ge, Feifei Ma
      Pages 52-65

    6. Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine

      • Chengwei Guo, Chenglong Ma, Shengyu Zhang
      Pages 66-77

    7. The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation

      • Yusupjan Habibulla, Jin-Hua Zhao, Hai-Jun Zhou
      Pages 78-88

    8. A Linear Time Algorithm for Ordered Partition

      • Yijie Han
      Pages 89-103

    9. Machine Scheduling with a Maintenance Interval and Job Delivery Coordination

      • Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel et al.
      Pages 104-114

    10. Lower and Upper Bounds for Random Mimimum Satisfiability Problem

      • Ping Huang, Kaile Su
      Pages 115-124

    11. On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

      • Gábor Ivanyos, Miklos Santha
      Pages 125-137

    12. Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints

      • Daniel Karapetyan, Andrei Gagarin, Gregory Gutin
      Pages 138-149

    13. On the Sound Covering Cycle Problem in Paired de Bruijn Graphs

      • Christian Komusiewicz, Andreea Radulescu
      Pages 150-161

    14. Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties

      • Gaidi Li, Dachuan Xu, Donglei Du, Chenchen Wu
      Pages 162-169

    15. Smaller Kernels for Several FPT Problems Based on Simple Observations

      • Wenjun Li, Shuai Hu
      Pages 170-179

    16. Parameterized Minimum Cost Partition of a Tree with Supply and Demand

      • Mugang Lin, Wenjun Li, Qilong Feng
      Pages 180-189
Back to top

Other volumes

  1. Frontiers in Algorithmics

Editors and Affiliations

  • Central South University, Changsha, China

    Jianxin Wang

  • Courant Institute, New York University, New York, USA

    Chee Yap

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation