Frontiers in Algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings (Theoretical Computer Science and General Issues)

個数：

電子版価格
¥9,512

電子版あり

Frontiers in Algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings (Theoretical Computer Science and General Issues)

Xiao, Mingyu (EDT)/ Rosamond, Frances (EDT)

ウェブストア価格 ¥11,535（本体¥10,487）
Springer International Publishing AG（2017/05発売）
外貨定価 US$ 54.99
ポイント 104pt

オンデマンド(OD/POD)版です。キャンセルは承れません。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 281 p.
言語 ENG
商品コード 9783319596044

Full 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.

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.