國立虎尾科技大學 |

Combinatorial Optimization and Applications = 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Optimization and Applications/ edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu.
Reminder of title:	15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings /
other author:	Xu, Dachuan.
Description:	XIII, 714 p. 138 illus., 50 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer Graphics. -
Online resource:	https://doi.org/10.1007/978-3-030-92681-6
ISBN:	9783030926816

Combinatorial Optimization and Applications = 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings /
Combinatorial Optimization and Applications15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings /[electronic resource] :edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu. - 1st ed. 2021. - XIII, 714 p. 138 illus., 50 illus. in color.online resource. - Theoretical Computer Science and General Issues,131352512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization.

This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021. The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.

ISBN: 9783030926816

Standard No.: 10.1007/978-3-030-92681-6doiSubjects--Topical Terms:

669895
Computer Graphics.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Combinatorial Optimization and Applications = 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings /
LDR:06154nam a22004095i 4500 001 1059484
003 DE-He213
005 20220222185221.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030926816 $9 978-3-030-92681-6
024 7 $a 10.1007/978-3-030-92681-6 $2 doi
035 $a 978-3-030-92681-6
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Combinatorial Optimization and Applications $h [electronic resource] : $b 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / $c edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIII, 714 p. 138 illus., 50 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 13135
505 0 $a Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization.
520 $a This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021. The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Computer graphics. $3 561602
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science. $3 573171
700 1 $a Xu, Dachuan. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1265028
700 1 $a Wu, Chenchen. $e editor. $1 https://orcid.org/0000-0002-6742-8816 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1363174
700 1 $a Du, Donglei. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1265029
700 1 $a Du, Ding-Zhu. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 670906
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030926809
776 0 8 $i Printed edition: $z 9783030926823
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-92681-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)