Combinatorial optimization and applications : 15th international conference, COCOA 2021, Tianjin, China, December 1719, 2021 : proceedings
 Responsibility
 DingZhu Du, Donglei Du, Chenchen Wu, Dachuan Xu (eds.).
 Digital
 text file
 Publication
 Cham : Springer, [2021]
 Copyright notice
 ©2021
 Physical description
 1 online resource : illustrations (some color)
 Series
 Lecture notes in computer science ; 13135.
 LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Online
More options
Description
Creators/Contributors
 Meeting
 COCOA (Conference) (15th : 2021 : Tianjin, China)
 Contributor
 Du, Dingzhu, editor.
 Du, Donglei, editor.
 Wu, Chenchen, editor.
 Xu, Dachuan (Computer scientist), editor.
Contents/Summary
 Contents

 Routing among Convex Polygonal Obstacles in the Plane. Target Coverage with Minimized Number of Camera Sensors. TwoStage Submodular Maximization under Curvature. An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem. The Selection of COVID19 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 OpenEnd Bin Packing Game. A LinearTime Streaming Algorithm for CardinalityConstrained Maximizing Monotone Nonsubmodular Set Functions. Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. Computing the OneVisibility CopWin 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. TwoStage Stochastic MaxWeight Independent Set Problems. Routing and Scheduling Problems with Two Agents on a LineShaped 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 UnionInfluenced in Social Networks. A Novel Algorithm for Max Sat Calling MOCE to Order. The Smallest Number of Vertices in a 2ArcStrong Digraph without Pair of ArcDisjoint in and outBranchings. Generalized SelfProfit Maximization in Attribute Networks. Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with WHierarchy Classes. Maximization of Monotone NonSubmodular Functions with a Knapsack Constraint over the Integer Lattice. Sublineartime Reductions for Big Data Computing. Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$Norm. Approximation Algorithms for Some MinMax and Minimum Stacker Crane Cover Problems. Succinct Data Structures for SP, BlockCactus and 3Leaf Power Graphs. Streaming Submodular Maximization under Differential Privacy Noise. Online Bottleneck SemiMatching. 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. TwoFacility Location Games with a Minimum Distance Requirement on a Circle. Open Shop Scheduling Problem with a NonResumable Flexible Maintenance Period. Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph. An Improved Approximation Algorithm for Squared Metric kFacility Location. Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number. The Fractional kTruncated Metric Dimension of Graphs. On Structural Parameterizations of the Offensive Alliance Problem. On the kcolored Rainbow Sets in Fixed Dimensions. CycleConnected Mixed Graphs and Related Problems. Directed width parameters on semicomplete digraphs. Improved Parameterized Approximation for Balanced kMedian. A LPBased Approximation Algorithm for Generalized Traveling Salesperson Path Problem. Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. Approximation Algorithm for MinMax Correlation Clustering Problem with Outliers. DelayConstrained Minimum Shortest Path Trees and Related Problems. On the Feedback Number of 3Uniform Linear Extremal Hypergraph. A MultiPass Streaming Algorithm for Regularized Submodular Maximization.
 (source: Nielsen Book Data)
 Publisher's summary

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 1719, 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.
(source: Nielsen Book Data)
Subjects
 Subjects
 Mathematical optimization > Congresses.
 Combinatorial optimization > Data processing > Congresses.
 Computer science > Mathematics > Congresses.
 Optimisation mathématique > Congrès.
 Optimisation combinatoire > Informatique > Congrès.
 Informatique > Mathématiques > Congrès.
 Combinatorial optimization > Data processing.
 Computer science > Mathematics.
 Mathematical optimization.
Bibliographic information
 Publication date
 2021
 Title variation
 COCOA 2021
 Series
 Lecture notes in computer science ; 13135
 LNCS sublibrary: SL1  Theoretical computer science and general issues
 Note
 International conference proceedings.
 Includes author index.
 ISBN
 9783030926816 (electronic bk.)
 3030926818 (electronic bk.)
 9783030926809
 303092680X
 DOI
 10.1007/9783030926816