Frontiers in Algorithmics

13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings

Häftad, Engelska, 2019

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2019-04-09
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor183
FörlagSpringer Nature Switzerland AG
ISBN9783030181253

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Hårdvara inom Data och it
Beräkning och matematisk analys inom Naturvetenskap och teknik
Artificiell intelligens inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange.- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem.- Efficient Guarding of Polygons and Terrains.- Graph Orientation with Edge Modifications.- Local Coloring: New Observations and New Reductions.- Secure Computation of Any Boolean Function Based on Any Deck of Cards.- A Novel Business Model for Electric Car Sharing.- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas.- Vertex-Critical (P5 ,banner)-Free Graphs.- An FPTAS for Stochastic Unbounded Min-Knapsack Problem.- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits.- Mutual Visibility by Robots with Persistent Memory.- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases.- An Improved Approximation Algorithm for the k-Means Problem with Penalties.