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

Author:   Yijia Chen ,  Xiaotie Deng ,  Mei Lu
Publisher:   Springer Nature Switzerland AG
Edition:   1st ed. 2019
Volume:   11458
ISBN:  

9783030181253


Pages:   183
Publication Date:   09 April 2019
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $116.41 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

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.

Full Product Details

Author:   Yijia Chen ,  Xiaotie Deng ,  Mei Lu
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   1st ed. 2019
Volume:   11458
Weight:   0.454kg
ISBN:  

9783030181253


ISBN 10:   3030181251
Pages:   183
Publication Date:   09 April 2019
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.  

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

ls

Shopping Cart
Your cart is empty
Shopping cart
Mailing List