Limit search to available items
Book Cover
E-book
Author International Frontiers of Algorithmics Workshop (11th : 2017 : Chengdu, China)

Title Frontiers in algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / Mingyu Xiao, Frances Rosamond (eds.)
Published Cham, Switzerland : Springer, 2017

Copies

Description 1 online resource (x, 281 pages) : illustrations
Series Lecture notes in computer science, 0302-9743 ; 10336
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 10336. 0302-9743
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Contents 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
Summary 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
Notes International conference proceedings
Includes author index
Bibliography Includes bibliographical references and author index
Notes Online resource; title from PDF title page (SpringerLink, viewed June 22, 2017)
Subject Computer algorithms -- Congresses
Discrete mathematics.
Mathematical theory of computation.
Algorithms & data structures.
Computers -- Data Processing.
Computers -- Programming -- Algorithms.
Computers -- Data Modeling & Design.
Computer algorithms
Genre/Form proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Form Electronic book
Author Xiao, Mingyu, editor.
Rosamond, Frances, editor.
ISBN 9783319596051
3319596055
3319596047
9783319596044
Other Titles FAW 2017