Cantitate/Preț
Produs

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13889

Editat de Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee
en Limba Engleză Paperback – 4 iun 2023
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. 

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; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theoryand temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49067 lei

Preț vechi: 61333 lei
-20% Nou

Puncte Express: 736

Preț estimativ în valută:
9390 9906$ 7848£

Carte tipărită la comandă

Livrare economică 01-15 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031343469
ISBN-10: 3031343468
Ilustrații: XXIII, 406 p. 86 illus., 48 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.6 kg
Ediția:2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.