Combinatorial Algorithms : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: SpringerLink Bücher | Lecture notes in computer science ; 10979Verlag: Cham : Springer International Publishing, 2018Beschreibung: Online-Ressource (XIX, 388 p. 78 illus, online resource)ISBN:

9783319946672

Schlagwörter:

Andere physische Formen: 9783319946665 | Erscheint auch als: 978-3-319-94666-5 Druck-Ausgabe | Printed edition: 9783319946665 DDC-Klassifikation:

004.0151

MSC: MSC: *68-06 | 68Rxx | 68Wxx | 00B25LOC-Klassifikation:

QA76.9.M35

DOI: DOI: 10.1007/978-3-319-94667-2Online-Ressourcen:

Zusammenfassung: This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computationZusammenfassung: Some Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?PPN: PPN: 1028033508Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB

Exemplare ( 0 )
Titelinformationen ( 1 )

Dieser Titel hat keine Exemplare

Reproduktion. (Springer eBook Collection. Computer Science)