Cantitate/Preț
Produs
Total produse
Vezi coșul
WALCOM: Algorithms and Computation: 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings de Ryuhei Uehara

WALCOM: Algorithms and Computation: 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12635

Editat de Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
en Limba Engleză Paperback – 31 ian 2021
This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. 

The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse
areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32845 lei

Preț vechi: 41056 lei
-20% Nou

Puncte Express: 493
Preț estimativ în valută:
6286€ • 6595$ • 5215£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030682101
ISBN-10: 3030682102
Pagini: 334
Ilustrații: XV, 334 p. 108 illus., 55 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.49 kg
Ediția:1st ed. 2021
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

Invited talks.- Majority Spanning Trees, Cotrees and Their Applications.- New Transportation Problem on a Graph with Sending and Bringing-Back Operations.- Long papers.- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees.- On Short Fastest Paths in Temporal Graphs.- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.- The Bike Sharing Problem.- Efficient Generation of a Card-based Uniformly Distributed Random Derangement.- Compact Data Structures for Dedekind Groups and Finite Rings.- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game.- Faster Multi-Sided Boundary Labelling.- On the Geometric Red-Blue Set Cover Problem.- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.- An Improvement of Reed's Treewidth Approximation.- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs.- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms.- Computing $L(p,1)$-Labeling with Combined Parameters.- On Compatible Matchings.- Upward Point Set Embeddings of Paths and Trees.- 2-colored Point-set Embeddings of Partial 2-trees.- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs.- APX-Hardness and Approximation for the $k$-Burning Number Problem.- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.- Physical Zero-Knowledge Proof for Ripple Effect.- Cyclic Shift Problems on Graphs.- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles.