000			04771nam a22004455i 4500
999			_c334853 _d334853 _x1
001			334853
003			ES-MaUEC
005			20230102114755.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210130s2021 gw | s |||| 0|eng d
020			_a9783030682118
024	7		_a10.1007/978-3-030-68211-8 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.A43 _b2021 EB
245	0	0	_aWALCOM: Algorithms and Computation : _b15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings _cedited by Ryuhei Uehara, Seok-Hee Hong, Subhas C Nandy
250			_aFirst edition 2021
264		1	_aCham, Switzerland _bSpringer International Publising _c2021
300			_a1 recurso en línea (XV, 334 páginas) _b108 ilustraciones, 55 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF _2rda
490	0		_aTheoretical Computer Science and General Issues ; _v12635
505	0		_aInvited 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.
520	3		_aThis 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.
988			_aSpringer_Computer_2021
650		7	_2embne _9151819 _aAlgoritmos computacionales
700	1		_aUehara, Ryuhei _eeditor literario _0(orcid)0000-0003-0895-3765 _1https://orcid.org/0000-0003-0895-3765 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aHong, Seok-Hee _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aNandy, Subhas C _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink
776	0	8	_iPrinted edition: _z9783030682101
776	0	8	_iPrinted edition: _z9783030682125
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-68211-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b06/2021 _dz _eIG _zSI