國立虎尾科技大學 |

Combinatorial algorithms = 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Combinatorial algorithms/ edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung.
其他題名:	29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings /
其他題名:	IWOCA 2018
其他作者:	Iliopoulos, Costas.
團體作者:	Workshop on the Preservation of Stability under Discretization
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xix, 388 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Combinatorial analysis - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-94667-2
ISBN:	9783319946672

Combinatorial algorithms = 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings /
Combinatorial algorithms29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings /[electronic resource] :IWOCA 2018edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung. - Cham :Springer International Publishing :2018. - xix, 388 p. :ill., digital ;24 cm. - Lecture notes in computer science,109790302-9743 ;. - Lecture notes in computer science ;6140..

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?.

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 computation.

ISBN: 9783319946672

Standard No.: 10.1007/978-3-319-94667-2doiSubjects--Topical Terms:

528589
Combinatorial analysis
--Congresses.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 511.6

Combinatorial algorithms = 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings /
LDR:04078nam a2200361 a 4500 001 927700
003 DE-He213
005 20180703094516.0
006 m d
007 cr nn 008maaau
008 190626s2018 gw s 0 eng d
020 $a 9783319946672 $q (electronic bk.)
020 $a 9783319946665 $q (paper)
024 7 $a 10.1007/978-3-319-94667-2 $2 doi
035 $a 978-3-319-94667-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA76.9.M35 $b I61 2018
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018 : proceedings / $c edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung.
246 3 $a IWOCA 2018
260 $a Cham : $c 2018. $b Springer International Publishing : $b Imprint: Springer,
300 $a xix, 388 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10979
505 0 $a 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?.
520 $a 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 computation.
650 0 $a Combinatorial analysis $v Congresses. $3 528589
650 0 $a Computer algorithms $v Congresses. $3 528474
650 1 4 $a Computer Science. $3 593922
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 669665
700 1 $a Iliopoulos, Costas. $3 1069320
700 1 $a Leong, Hon Wai. $3 1207119
700 1 $a Sung, Wing-Kin. $3 1129981
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-94667-2
950 $a Computer Science (Springer-11645)