Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Computing and Combinatorics

E-BookPDF1 - PDF WatermarkE-Book
419 Seiten
Englisch
Springer International Publishingerschienen am08.12.20231st ed. 2024
Verfügbare Formate
BuchKartoniert, Paperback
EUR79,17
E-BookPDF1 - PDF WatermarkE-Book
EUR78,10
E-BookPDF1 - PDF WatermarkE-Book
EUR78,10

Produkt

Details
Weitere ISBN/GTIN9783031491931
ProduktartE-Book
EinbandartE-Book
FormatPDF
Format Hinweis1 - PDF Watermark
FormatE107
Erscheinungsjahr2023
Erscheinungsdatum08.12.2023
Auflage1st ed. 2024
ReiheLecture Notes in Computer Science
Reihen-Nr.14423
Seiten419 Seiten
SpracheEnglisch
IllustrationenXVII, 419 p. 61 illus., 30 illus. in color.
Artikel-Nr.13175645
Rubriken
Genre9200

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr