| 000 | 07170nam a22006255i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-94776-1 | ||
| 003 | DE-He213 | ||
| 005 | 20210201191501.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 180629s2018 gw | s |||| 0|eng d | ||
| 020 |
_a9783319947761 _9978-3-319-94776-1 |
||
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aComputing and Combinatorics _h[electronic resource] : _b24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings / _cedited by Lusheng Wang, Daming Zhu. |
| 250 | _a1st ed. 2018. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2018. |
|
| 300 |
_aXIX, 767 p. 134 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 ; _v10976 |
|
| 500 | _aAcceso multiusuario | ||
| 505 | 0 | _aConstructing Independent Spanning Trees on Bubble-Sort Networks -- Exact Algorithms for Finding Partial Edge-Disjoint Paths -- A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications -- Contextual Dependent Click Bandit Algorithm for Web Recommendation -- LP-based pivoting algorithm for higher-order correlation clustering -- Approximation algorithms for a two-phase knapsack problem -- More Routes for Evacuation -- Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem -- Approximating Global Optimum for Probabilistic Truth Discovery -- Online interval scheduling to maximize total satisfaction -- Properties of Minimal-Perimeter Polyominoes -- Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons -- Polygon Queries for Convex Hulls of Points -- Synergistic Solutions for Merging and Computing Planar Convex Hulls -- Cophenetic Distances: A Near-Linear Time Algorithmic Framework -- Computing Coverage Kernels Under Restricted Settings -- Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets -- Approximation algorithms for two-machine ow-shop scheduling with a conflict graph -- On Contact Representations of Directed Planar Graphs -- Computation and Growth of Road Network Dimensions -- Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings -- Directed path-width and directed tree-width of directed co-graphs -- Generalized Graph k-Coloring Games -- On Colorful Bin Packing Games -- Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality -- The Path Set Packing Problem -- Manipulation Strategies for the Rank-Maximal Matching Problem -- Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search -- An FPT Algorithm for Contraction to Cactus -- An approximation framework for bounded facility location problems -- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect -- Solving the Gene Duplication Feasibility Problem in Linear Time -- An Efficiently Recognisable Subset of Hypergraphic Sequences -- Partial Homology Relations - Satisfiability in terms of Di-Cographs -- Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds -- Reconfiguring spanning and induced subgraphs -- Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators -- Efficient Enumeration of Bipartite Subgraphs in Graphs -- Bipartite Graphs of Small Readability -- Maximum colorful cliques in vertex-colored graphs -- Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage -- Characterizing Star-PCGs -- Liar's Dominating Set in Unit Disk Graphs -- Minimum Spanning Tree of Line Segments -- Improved learning of k-parities -- On a Fixed Haplotype Variant of the Minimum Error Correction Problem -- Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces -- Amplitude Amplification for Operator Identification and Randomized Classes -- Reconstruction of Boolean Formulas in Conjunctive Normal Form -- A Faster FPTAS for the Subset-Sums Ratio Problem -- A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time -- Non-Determinism Reduces Construction Time in Active Self-Assembly Using an Insertion Primitive -- Minimum Membership Hitting Sets of Axis Parallel Segments -- Minimum Transactions Problem -- Heuristic algorithms for the min-max edge 2-coloring problem -- Geometric Spanners in the MapReduce Model -- SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands -- Lower Bounds for Special Cases of Syntactic Multilinear ABPs -- Approximation Algorithms on Multiple Two-Stage Flowshops -- Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem -- New Bounds for Energy Complexity of Boolean Functions -- Hitting and Covering Partially. | |
| 520 | _aThis book constitutes the proceedings of the 24th International Conference on Computing and Combinatorics, COCOON 2018, held in Qing Dao, China, in July 2018. The 62 papers presented in this volume were carefully reviewed and selected from 120 submissions. They deal with the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing. | ||
| 541 |
_fUABC ; _cTemporal ; _d01/01/2021-12/31/2023. |
||
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aComputer science-Mathematics. | |
| 650 | 0 | _aNumerical analysis. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aComputer communication systems. | |
| 650 | 1 | 4 |
_aAlgorithm Analysis and Problem Complexity. _0https://scigraph.springernature.com/ontologies/product-market-codes/I16021 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _0https://scigraph.springernature.com/ontologies/product-market-codes/I17028 |
| 650 | 2 | 4 |
_aNumeric Computing. _0https://scigraph.springernature.com/ontologies/product-market-codes/I1701X |
| 650 | 2 | 4 |
_aData Structures. _0https://scigraph.springernature.com/ontologies/product-market-codes/I15017 |
| 650 | 2 | 4 |
_aComputer Communication Networks. _0https://scigraph.springernature.com/ontologies/product-market-codes/I13022 |
| 700 | 1 |
_aWang, Lusheng. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aZhu, Daming. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319947754 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319947778 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues ; _v10976 |
|
| 856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=https://doi.org/10.1007/978-3-319-94776-1 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cLIBRO_ELEC | ||
| 999 |
_c243995 _d243994 |
||