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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo V9KJKLBH3G
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783031343469
Quantità: 2 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 432. Codice articolo 397858567
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 432. Codice articolo 18398551250
Quantità: 4 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 432. Codice articolo 26398551256
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Kartoniert / Broschiert. Condizione: New. Codice articolo 864557271
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783031343469
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: 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. Codice articolo 126889904
Quantità: 5 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783031343469
Quantità: 1 disponibili