Frontiers in Algorithmics

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

AvYijia Chen,Xiaotie Deng

Häftad, Engelska, 2019

Del 11458 i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2019-04-09
Mått:155 x 235 x 11 mm
Vikt:306 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:183
Förlag:Springer Nature Switzerland AG
ISBN:9783030181253

Utforska kategorier

Innehållsförteckning

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.