Cantitate/Preț
Produs
Total produse
Vezi coșul
Computing and Combinatorics de Weili Wu

Computing and Combinatorics: Lecture Notes in Computer Science, cartea 14423

Editat de Weili Wu, Guangmo Tong
en Limba Engleză Paperback – 9 dec 2023
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.


Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 52093 lei  6-8 săpt.
  Springer – 9 dec 2023 52093 lei  6-8 săpt.
  Springer – 9 dec 2023 52137 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 52137 lei

Preț vechi: 65170 lei
-20%

Puncte Express: 782
Preț estimativ în valută:
9219€ • 10572$ • 7968£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031491924
ISBN-10: 3031491920
Pagini: 440
Ilustrații: XVII, 419 p. 61 illus., 30 illus. in color.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1st edition 2024
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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 Newton’s 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.