Computing and Combinatorics (Registro nro. 243995)

MARC details
000 -LIDER
fixed length control field 07170nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-319-94776-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20210201191501.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 180629s2018 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319947761
-- 978-3-319-94776-1
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Computing and Combinatorics
Medium [electronic resource] :
Remainder of title 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings /
Statement of responsibility, etc. edited by Lusheng Wang, Daming Zhu.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2018.
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2018.
300 ## - PHYSICAL DESCRIPTION
Extent XIX, 767 p. 134 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues ;
Volume/sequential designation 10976
500 ## - GENERAL NOTE
General note Acceso multiusuario
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Constructing 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 ## - SUMMARY, ETC.
Summary, etc. This 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 ## - IMMEDIATE SOURCE OF ACQUISITION NOTE
Owner UABC ;
Method of acquisition Temporal ;
Date of acquisition 01/01/2021-12/31/2023.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer science-Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Numerical analysis.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer communication systems.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Algorithm Analysis and Problem Complexity.
-- https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Discrete Mathematics in Computer Science.
-- https://scigraph.springernature.com/ontologies/product-market-codes/I17028
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Numeric Computing.
-- https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Data Structures.
-- https://scigraph.springernature.com/ontologies/product-market-codes/I15017
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer Communication Networks.
-- https://scigraph.springernature.com/ontologies/product-market-codes/I13022
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Wang, Lusheng.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Zhu, Daming.
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
Relationship information Printed edition:
International Standard Book Number 9783319947754
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783319947778
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues ;
Volume number/sequential designation 10976
856 40 - ELECTRONIC LOCATION AND ACCESS
Public note Libro electrónico
Uniform Resource Identifier http://148.231.10.114:2048/login?url=https://doi.org/10.1007/978-3-319-94776-1
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Libro Electrónico
Existencias
Estado de retiro Colección Ubicación permanente Ubicación actual Fecha de ingreso Total Checkouts Date last seen Número de copia Tipo de material
  Colección de Libros Electrónicos Biblioteca Electrónica Biblioteca Electrónica 01/02/2021   01/02/2021 1 Libro Electrónico

Con tecnología Koha