<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>05361nam a22006495i 4500</leader>
  <controlfield tag="001">978-3-031-49190-0</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20251030110849.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">231208s2024    sz |    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9783031491900</subfield>
    <subfield code="9">978-3-031-49190-0</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/978-3-031-49190-0</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
    <subfield code="a">QA75.5-76.95</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYA</subfield>
    <subfield code="2">bicssc</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">COM014000</subfield>
    <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYA</subfield>
    <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Computing and Combinatorics</subfield>
    <subfield code="h">[electronic resource] :</subfield>
    <subfield code="b">29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15&#x2013;17, 2023, Proceedings, Part I /</subfield>
    <subfield code="c">edited by Weili Wu, Guangmo Tong.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1st ed. 2024.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Cham :</subfield>
    <subfield code="b">Springer Nature Switzerland :</subfield>
    <subfield code="b">Imprint: Springer,</subfield>
    <subfield code="c">2024.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">XVII, 413 p. 60 illus., 30 illus. in color.</subfield>
    <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14422</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Combinatorics and Algorithms -- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher -- Extended formulations via decision diagrams -- Greedy Gray codes for Dyck words and ballot sequences -- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication -- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences -- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons -- An Approach to Agent Path Planning under Temporal Logic Constraints -- The Heterogeneous Rooted Tree Cover Problem -- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model -- The Regularized Submodular Maximization via the Lyapunov Method -- Topological network-control games -- Lower Bounds of Functions on Finite Abelian Groups -- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering -- Random Shortening of Linear Codes and Applications -- Algorithms for Full-View Coverage of Targets with Group Set Cover -- Improved bounds for the binary paint shop problem -- Algorithmic Solution in Applications -- Fitch Graph Completion -- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays -- Diversity and freshness-aware regret minimizing set queries -- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback -- Cabbage Can&#x2019;t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals -- k-median/means with outliers revisited: a simple fpt approximation -- A cost-sharing scheme for the $k$-product facility location game with penalties -- Algorithm in Networks -- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks -- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty -- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network -- Solving systems of linear equations through zero forcing sets -- Profit Maximization for Competitive Influence Spread in Social Networks -- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing -- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes -- Approval-Based Participatory Budgeting with Donations.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This two volume set LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections: Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks. Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer science.</subfield>
    <subfield code="9">58552</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Image processing</subfield>
    <subfield code="x">Digital techniques.</subfield>
    <subfield code="9">64228</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer vision.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Data structures (Computer science).</subfield>
    <subfield code="9">66708</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Information theory.</subfield>
    <subfield code="9">57783</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer science</subfield>
    <subfield code="x">Mathematics.</subfield>
    <subfield code="9">64041</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Discrete mathematics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Numerical analysis.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
    <subfield code="a">Theory of Computation.</subfield>
    <subfield code="9">67552</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Computer Imaging, Vision, Pattern Recognition and Graphics.</subfield>
    <subfield code="9">65550</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Data Structures and Information Theory.</subfield>
    <subfield code="9">66709</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Discrete Mathematics in Computer Science.</subfield>
    <subfield code="9">68046</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Symbolic and Algebraic Manipulation.</subfield>
    <subfield code="9">68047</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Numerical Analysis.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Wu, Weili.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">68048</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Tong, Guangmo.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">68049</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Springer Nature eBook</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031491894</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031491917</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14422</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://doi.org/10.1007/978-3-031-49190-0</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SXCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-LNC</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">56765</subfield>
    <subfield code="d">56765</subfield>
  </datafield>
</record>
