Vor Ort
Merkzettel Warenkorb
Produktbild: Computing and Combinatorics
Band 14423 - 12%

Computing and Combinatorics 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II

Aus der Reihe Lecture Notes in Computer Science
12% sparen

76,99 € UVP 87,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.12.2023

Herausgeber

Weili Wu + weitere

Verlag

Springer

Seitenzahl

419

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

663 g

Auflage

1st ed. 2024

Sprache

Englisch

ISBN

978-3-031-49192-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.12.2023

Herausgeber

Verlag

Springer

Seitenzahl

419

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

663 g

Auflage

1st ed. 2024

Sprache

Englisch

ISBN

978-3-031-49192-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computing and Combinatorics
  • 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.