000 06008nam a22007095i 4500
001 978-3-031-34347-6
003 DE-He213
005 20240730181020.0
007 cr nn 008mamaa
008 230529s2023 sz | s |||| 0|eng d
020 _a9783031343476
_9978-3-031-34347-6
024 7 _a10.1007/978-3-031-34347-6
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Algorithms
_h[electronic resource] :
_b34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings /
_cedited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXXIII, 406 p. 86 illus., 48 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13889
505 0 _aMulti-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.
520 _aThis 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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aAlgorithms.
_93390
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer graphics.
_94088
650 0 _aNumerical analysis.
_94603
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Engineering and Networks.
_9122970
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aNumerical Analysis.
_94603
700 1 _aHsieh, Sun-Yuan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122971
700 1 _aHung, Ling-Ju.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122972
700 1 _aLee, Chia-Wei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122973
710 2 _aSpringerLink (Online service)
_9122974
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031343469
776 0 8 _iPrinted edition:
_z9783031343483
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13889
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-34347-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90645
_d90645