Frontiers in Algorithmics
11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings
Published on 23. May 2017
Book
Paperback/Softback
X, 281 pages
978-3-319-59604-4 (ISBN)
Description
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.
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.
More details
Series
Edition
1st ed. 2017
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
50 s/w Abbildungen
X, 281 p. 50 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
446 gr
ISBN-13
978-3-319-59604-4 (9783319596044)
DOI
10.1007/978-3-319-59605-1
Schweitzer Classification
Other editions
Additional editions
Mingyu Xiao | Frances Rosamond
Frontiers in Algorithmics
11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings
E-Book
06/2017
Springer
€53.49
Available for download
Content
On the Complexity of Minimizing the Total Calibration Cost.- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments.- On Computational Aspects of Greedy Partitioning of Graphs.- Maximum Edge Bicliques in Tree Convex Bipartite Graphs.- Complete Submodularity Characterization in the Comparative Independent Cascade Model.- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate.- Designing and Implementing Algorithms for the Closest String Problem.- The Broken-Triangle Property with Adjoint Values.- Online Knapsack Problem under Concave Functions.- Fluctuated Fitting under the L1-metric.- Optimal Partitioning Which Maximizes the Weighted Sum of Products.- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity.- Online Strategies for Evacuating from a Convex Region in the Plane.- A further analysis of the dynamic dominant resource fairness mechanism.- A 42k Kernel for the Complementary Maximal Strip Recovery Problem.- On-line Scheduling with a Monotonous Subsequence Constraint.- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling.- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters.- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.- Geodectic Contraction Games on Trees.- On Approximation Algorithms for Two-Stage Scheduling Problems.- A New Lower Bound for Positive Zero Forcing.- Phase Transition for Maximum Not-All-Equal Satisfiability.