Muutke küpsiste eelistusi

E-raamat: Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 80,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part IISuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830314919316e.html