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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Zustand: new. Questo è un articolo print on demand. Bestandsnummer des Verkäufers V9KJKLBH3G
Anzahl: Mehr als 20 verfügbar
Anbieter: Basi6 International, Irving, TX, USA
Zustand: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service. Bestandsnummer des Verkäufers POD-350108
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA2023, held in Tainan, Taiwan, during June 7-10, 2023.The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmicand combinatorical aspects of cryptography and information security; algorithmicgame theory and complexity of games; approximation algorithms;complexity theory; combinatorics and graph theory; combinatorial generation,enumeration and counting; combinatorial optimization; combinatoricsof words; computational biology; computational geometry; decompositionsand combinatorial designs; distributed and network algorithms; experimentalcombinatorics; fine-grained complexity; graph algorithms and modellingwith graphs; graph drawing and graph labelling; network theoryand temporalgraphs; quantum computing and algorithms for quantum computers;online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms. 432 pp. Englisch. Bestandsnummer des Verkäufers 9783031343469
Anzahl: 2 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 432. Bestandsnummer des Verkäufers 26398551256
Anzahl: 4 verfügbar
Anbieter: moluna, Greven, Deutschland
Kartoniert / Broschiert. Zustand: New. Bestandsnummer des Verkäufers 864557271
Anzahl: Mehr als 20 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 432. Bestandsnummer des Verkäufers 397858567
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 432. Bestandsnummer des Verkäufers 18398551250
Anzahl: 4 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 432 pp. Englisch. Bestandsnummer des Verkäufers 9783031343469
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Combinatorial Algorithms | 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings | Sun-Yuan Hsieh (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xxiii | Englisch | 2023 | Springer | EAN 9783031343469 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Bestandsnummer des Verkäufers 126889904
Anzahl: 5 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA2023, held in Tainan, Taiwan, during June 7-10, 2023.The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmicand combinatorical aspects of cryptography and information security; algorithmicgame theory and complexity of games; approximation algorithms;complexity theory; combinatorics and graph theory; combinatorial generation,enumeration and counting; combinatorial optimization; combinatoricsof words; computational biology; computational geometry; decompositionsand combinatorial designs; distributed and network algorithms; experimentalcombinatorics; fine-grained complexity; graph algorithms and modellingwith graphs; graph drawing and graph labelling; network theoryand temporalgraphs; quantum computing and algorithms for quantum computers;online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms. Bestandsnummer des Verkäufers 9783031343469
Anzahl: 1 verfügbar