Skip to main content
SpringerLink
Log in

Frontiers in Algorithmics

11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Mingyu Xiao

    1. University of Electronic Science and Technology of China, Chengdu, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Frances Rosamond

    1. University of Bergen, Bergen, Norway

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

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

Included in the following conference series:

Conference proceedings info: FAW 2017.

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 EPUB and 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 (24 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. On the Complexity of Minimizing the Total Calibration Cost

    • Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos
    Pages 1-12

  3. On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model

    • Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu
    Pages 13-21

  4. The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments

    • Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
    Pages 22-33

  5. On Computational Aspects of Greedy Partitioning of Graphs

    • Piotr Borowiecki
    Pages 34-46

  6. Maximum Edge Bicliques in Tree Convex Bipartite Graphs

    • Hao Chen, Tian Liu
    Pages 47-55

  7. Complete Submodularity Characterization in the Comparative Independent Cascade Model

    • Wei Chen, Hanrui Zhang
    Pages 56-67

  8. A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate

    • Xiaoli Chen, Weijun Xu
    Pages 68-78

  9. Designing and Implementing Algorithms for the Closest String Problem

    • Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang
    Pages 79-90

  10. The Broken-Triangle Property with Adjoint Values

    • Jian Gao, Rong Chen, Minghao Yin, Hui Li
    Pages 91-102

  11. Online Knapsack Problem Under Concave Functions

    • Xin Han, Ning Ma, Kazuhisa Makino, He Chen
    Pages 103-114

  12. Fluctuated Fitting Under the \(\ell _1\)-metric

    • Kai Jin
    Pages 115-126

  13. Optimal Partitioning Which Maximizes the Weighted Sum of Products

    • Kai Jin
    Pages 127-138

  14. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity

    • Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan
    Pages 139-150

  15. Online Strategies for Evacuating from a Convex Region in the Plane

    • Songhua Li, Yinfeng Xu
    Pages 151-162

  16. A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism

    • Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang
    Pages 163-174

  17. A 42k Kernel for the Complementary Maximal Strip Recovery Problem

    • Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang
    Pages 175-186

  18. On-line Scheduling with a Monotonous Subsequence Constraint

    • Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo
    Pages 187-195

  19. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling

    • Jingjing Ma, Haitao Jiang, Daming Zhu, Shu Zhang
    Pages 196-208

  20. FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters

    • Diptapriyo Majumdar, Venkatesh Raman
    Pages 209-220
Back to top

Other volumes

  1. Frontiers in Algorithmics

Keywords

About this book

This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017.
The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

Editors and Affiliations

  • University of Electronic Science and Technology of China, Chengdu, China

    Mingyu Xiao

  • University of Bergen, Bergen, Norway

    Frances Rosamond

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation