Computing and Combinatorics (Record no. 175924)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06552nam a22006375i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-030-58150-3 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423125243.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 200827s2020 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783030581503 |
| -- | 978-3-030-58150-3 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-030-58150-3 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Computing and Combinatorics |
| Medium | [electronic resource] : |
| Remainder of title | 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / |
| Statement of responsibility, etc | edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2020. |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2020. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIV, 678 p. 300 illus., 64 illus. in color. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume number/sequential designation | 12273 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient ShortestPath Queries in Road Networks -- Visibility polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited.-Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks.-W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane.-Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems.-Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility.-Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-ConnectedSpanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality.-Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of TriconnectedPlanar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and IstGeneralizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams.-Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer engineering. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer networks . |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Information theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial intelligence. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Engineering and Networks. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data Structures and Information Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Engineering and Networks. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial Intelligence. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Kim, Donghyun. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Uma, R. N. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Cai, Zhipeng. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Lee, Dong Hoon. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783030581497 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783030581510 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| -- | 2512-2029 ; |
| Volume number/sequential designation | 12273 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-030-58150-3">https://doi.org/10.1007/978-3-030-58150-3</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.