000 | 05635nam a22006855i 4500 | ||
---|---|---|---|
001 | 978-3-319-94667-2 | ||
003 | DE-He213 | ||
005 | 20240730202920.0 | ||
007 | cr nn 008mamaa | ||
008 | 180703s2018 sz | s |||| 0|eng d | ||
020 |
_a9783319946672 _9978-3-319-94667-2 |
||
024 | 7 |
_a10.1007/978-3-319-94667-2 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCombinatorial Algorithms _h[electronic resource] : _b29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings / _cedited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung. |
250 | _a1st ed. 2018. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2018. |
|
300 |
_aXIX, 388 p. 78 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v10979 |
|
505 | 0 | _aSome 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?. | |
520 | _aThis 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 computation. | ||
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aData protection. _97245 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aImage processing _xDigital techniques. _94145 |
|
650 | 0 |
_aComputer vision. _9173663 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aData and Information Security. _931990 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aComputer Imaging, Vision, Pattern Recognition and Graphics. _931569 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
700 | 1 |
_aIliopoulos, Costas. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9173664 |
|
700 | 1 |
_aLeong, Hon Wai. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9173665 |
|
700 | 1 |
_aSung, Wing-Kin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9173666 |
|
710 | 2 |
_aSpringerLink (Online service) _9173667 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319946665 |
776 | 0 | 8 |
_iPrinted edition: _z9783319946689 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v10979 _9173668 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-94667-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c97247 _d97247 |