Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings

Voorkant
Yijia Chen, Xiaotie Deng, Mei Lu
Springer, 15 apr 2019 - 183 pagina's

This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019.

The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

 

Inhoudsopgave

A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange
1
A Local Search 43approximation Algorithm for the Minimum 3path Partition Problem
14
Efficient Guarding of Polygons and Terrains
26
Graph Orientation with Edge Modifications
38
New Observations and New Reductions
51
Secure Computation of Any Boolean Function Based on Any Deck of Cards
63
A Novel Business Model for Electric Car Sharing
76
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes
88
VertexCritical P5 bannerFree Graphs
111
An FPTAS for Stochastic Unbounded MinKnapsack Problem
121
The Inapproximability of kDominatingSet for Parameterized AC0 Circuits
133
Mutual Visibility by Robots with Persistent Memory
144
Pushing the Online MatrixVector Conjecture OffLine and Identifying Its Easy Cases
156
An Improved Approximation Algorithm for the kMeans Problem with Penalties
170
Author Index
182
Copyright

ReadOnce Resolutions in Horn Formulas
100

Overige edities - Alles bekijken

Veelvoorkomende woorden en zinsdelen

Bibliografische gegevens