Cantitate/Preț
Produs
Total produse
Vezi coșul
Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings de Yijia Chen

Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11458

Editat de Yijia Chen, Xiaotie Deng, Mei Lu
en Limba Engleză Paperback – 9 apr 2019
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32086 lei

Preț vechi: 40108 lei
-20% Nou

Puncte Express: 481
Preț estimativ în valută:
6141€ • 6378$ • 5101£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030181253
ISBN-10: 3030181251
Pagini: 300
Ilustrații: X, 183 p. 83 illus., 19 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.28 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.