Cover image for Combinatorial Algorithms 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings
Title:
Combinatorial Algorithms 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings
Author:
Hsieh, Sun-Yuan. editor.
ISBN:
9783031343476
Edition:
1st ed. 2023.
Physical Description:
XXIII, 406 p. 86 illus., 48 illus. in color. online resource.
Series:
Lecture Notes in Computer Science, 13889
Contents:
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.
Added Corporate Author:
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Shelf Number
Status
Item Holds
Searching...
E-Book 520985-1001 XX(520985.1)
Searching...

On Order