Muutke küpsiste eelistusi

Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 1517, 2023, Proceedings, Part II 1st ed. 2024 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 419 pages, kõrgus x laius: 235x155 mm, kaal: 670 g, 30 Illustrations, color; 31 Illustrations, black and white; XVII, 419 p. 61 illus., 30 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14423
  • Ilmumisaeg: 09-Dec-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031491920
  • ISBN-13: 9783031491924
Teised raamatud teemal:
  • Pehme köide
  • Hind: 76,49 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 89,99 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 1517, 2023, Proceedings, Part II 1st ed. 2024Suurem pilt
  • Formaat: Paperback / softback, 419 pages, kõrgus x laius: 235x155 mm, kaal: 670 g, 30 Illustrations, color; 31 Illustrations, black and white; XVII, 419 p. 61 illus., 30 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14423
  • Ilmumisaeg: 09-Dec-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031491920
  • ISBN-13: 9783031491924
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031491924.html
Märksõnad:

This two volume set volume 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.



Complexity and Approximation.- Complexity and Enumeration in Models of
Genome Rearrangement.- Conditional automatic complexity and its
metrics.- Streaming and Query Once Space Complexity of Longest Increasing
Subsequence.- Approximating Decision Trees with Priority
Hypotheses.- Approximating the $\lambda$-low-density Value.- Exponential Time
Complexity of the Complex Weighted Boolean \#CSP.- Hardness and approximation
for the star $p$-hub routing cost problem in $\Delta_\beta$-metric
graphs.- Graph Algorithms.- Linear Time Algorithms for NP-hard Problems
restricted to GaTEx Graphs.- Polynomial Turing Compressions for Some Graph
Problems Parameterized by Modular-Width.- Shortest Longest-Path Graph
Orientations.- Sink Location Problems in Dynamic Flow Grid Networks.- List
3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite
Graphs.- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4
Graphs and General Graphs.- Sum-of-Local-Effects Data Structures for
Separable Graphs.- Applied Algorithms.- Variants of Euclidean k-center
Clusterings.- Red-black Spanners for Mixed-charging Vehicular
Networks.- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds
via Locally-iterative Algorithms.- On Detecting Some Defective Items in Group
Testing.- An Efficient Data Analysis Method for Big Data using Multiple-Model
Linear Regression.- Multi-Load Agent Path Finding for Online Pickup and
Delivery Problem.- Improved Sourcewise Roundtrip Spanners with Constant
Stretch.- Randomized Data Partitioning with Efficient Search, Retrieval and
Privacy Preservation.- The k edge-vertex domination
problem.- Resource-Adaptive Newtons Method for Distributed
Learning.- DR-submodular Function Maximization with Adaptive Stepsize.- On
the Routing Problems in Graphs with Ordered Forbidden
Transitions.- DelayingDecisions and Reservation Costs.- A PTAS Framework for
Clustering Problems in Doubling Metrics.- A Physical Zero-knowledge Proof for
Sumplete, a Puzzle Generated by Chat GPT.