1 option
WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12635
- Theoretical Computer Science and General Issues, 2512-2029 ; 12635
- Language:
- English
- Subjects (All):
- Computer science.
- Data structures (Computer science).
- Information theory.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer graphics.
- Application software.
- Theory of Computation.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Computer and Information Systems Applications.
- Local Subjects:
- Theory of Computation.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Computer and Information Systems Applications.
- Physical Description:
- 1 online resource (XV, 334 pages) : 108 illustrations, 55 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- 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. .
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-68211-8
- 9783030682118
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.