國立高雄大學圖資館 |

登入

回首頁 到查詢結果 [ subject:"Algorithms" ]

Combinatorial algorithms34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial algorithmsedited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee.
其他題名:	34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings /
其他題名:	IWOCA 2023
其他作者:	Hsieh, Sun-Yuan.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	1 online resource (xxiii, 406 p.) :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysisCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-34347-6
ISBN:	9783031343476$q(electronic bk.)

Combinatorial algorithms34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings /
Combinatorial algorithms34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings /[electronic resource] :IWOCA 2023edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee. - Cham :Springer Nature Switzerland :2023. - 1 online resource (xxiii, 406 p.) :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,138891611-3349 ;. - Lecture notes in computer science ;4891..

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 Complete Subgraphs 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.

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 theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.

ISBN: 9783031343476$q(electronic bk.)

Standard No.: 10.1007/978-3-031-34347-6doiSubjects--Topical Terms:

384513
Combinatorial analysis
--Congresses.

LC Class. No.: QA164

Dewey Class. No.: 004.0151

Combinatorial algorithms34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings /
LDR:04487nmm a2200373 a 4500 001 637684
003 DE-He213
005 20230529100050.0
006 m d
007 cr nn 008maaau
008 230921s2023 sz s 0 eng d
020 $a 9783031343476$q(electronic bk.)
020 $a 9783031343469$q(paper)
024 7 $a 10.1007/978-3-031-34347-6 $2 doi
035 $a 978-3-031-34347-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA164 $b .I61 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023 : proceedings / $c edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee.
246 3 $a IWOCA 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a 1 online resource (xxiii, 406 p.) : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 13889
505 0 $a 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 Complete Subgraphs 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 $a 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 theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.
650 0 $a Combinatorial analysis $v Congresses. $3 384513
650 0 $a Algorithms $3 253943
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Numerical Analysis. $3 275681
700 1 $a Hsieh, Sun-Yuan. $3 940895
700 1 $a Hung, Ling-Ju. $3 944164
700 1 $a Lee, Chia-Wei. $3 944165
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-34347-6
950 $a Computer Science (SpringerNature-11645)