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.

Combinatorial Algorithms

34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings
BuchKartoniert, Paperback
406 Seiten
Englisch
Springererschienen am04.06.20232023
This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7-10, 2023. graph algorithms and modelling with graphs; quantum computing and algorithms for quantum computers;mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR80,24
E-BookPDF1 - PDF WatermarkE-Book
EUR80,24

Produkt

KlappentextThis book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7-10, 2023. graph algorithms and modelling with graphs; quantum computing and algorithms for quantum computers;
Details
ISBN/GTIN978-3-031-34346-9
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2023
Erscheinungsdatum04.06.2023
Auflage2023
ReiheLecture Notes in Computer Science
Seiten406 Seiten
SpracheEnglisch
IllustrationenXXIII, 406 p. 86 illus., 48 illus. in color.
Artikel-Nr.52530626

Inhalt/Kritik

Inhaltsverzeichnis
Multi-Priority Graph Sparsification.- Point Enclosure Problem for Homothetic Polygons.- Hardness of Balanced Mobiles.- Burn and Win.- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness.- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems.- Parameterized algorithms for Eccentricity Shortest Path Problem.- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.- A Polyhedral Perspective on Tropical Convolutions.- Online Knapsack with Removal and Recourse.- Minimum Surgical Probing with Convexity Constraints.- A linear algorithm for radio k-coloring powers of paths having small diameter.- Capacity-Preserving Subgraphs of Directed Flow Networks.- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms.- Finding Small CompleteSubgraphs Efficiently.- Maximal distortion of geodesic diameters in polygonal domains.- On 2-strong connectivity orientations of mixed graphs and related problems.- Make a Graph Singly Connected By Edge Orientations.- Computing the Center of Uncertain Points on Cactus Graphs.- Cosecure Domination: Hardness Results and Algorithms.- Optimal cost-based allocations under two-sided preferences.- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders.- On Computing Large Temporal (Unilateral) Connected Components.- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings.- Finding Perfect Matching Cuts Faster.- Connected Feedback Vertex Set on AT-Free graphs.- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing.- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism.- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs.- Partial-Adaptive Submodular Maximization.- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform.mehr

Schlagworte

Autor