001441336 000__ 07717cam\a2200733\i\4500
001441336 001__ 1441336
001441336 003__ OCoLC
001441336 005__ 20230309004733.0
001441336 006__ m\\\\\o\\d\\\\\\\\
001441336 007__ cr\un\nnnunnun
001441336 008__ 211216s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001441336 019__ $$a1288463854$$a1288561179$$a1288634858$$a1292518107$$a1294358630
001441336 020__ $$a9783030926816$$q(electronic bk.)
001441336 020__ $$a3030926818$$q(electronic bk.)
001441336 020__ $$z9783030926809
001441336 020__ $$z303092680X
001441336 0247_ $$a10.1007/978-3-030-92681-6$$2doi
001441336 035__ $$aSP(OCoLC)1288671048
001441336 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCF$$dDKU$$dOCLCO$$dDCT$$dOCLCQ$$dOCLCO$$dOCLCQ
001441336 049__ $$aISEA
001441336 050_4 $$aQA402.5$$b.C66 2021
001441336 08204 $$a004.01/51$$223
001441336 1112_ $$aCOCOA (Conference)$$n(15th :$$d2021 :$$cTianjin, China)
001441336 24510 $$aCombinatorial optimization and applications :$$b15th international conference, COCOA 2021, Tianjin, China, December 17-19, 2021 : proceedings /$$cDing-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu (eds.).
001441336 24630 $$aCOCOA 2021
001441336 264_1 $$aCham :$$bSpringer,$$c[2021]
001441336 264_4 $$c©2021
001441336 300__ $$a1 online resource :$$billustrations (some color)
001441336 336__ $$atext$$btxt$$2rdacontent
001441336 337__ $$acomputer$$bc$$2rdamedia
001441336 338__ $$aonline resource$$bcr$$2rdacarrier
001441336 347__ $$atext file
001441336 347__ $$bPDF
001441336 4901_ $$aLecture notes in computer science ;$$v13135
001441336 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
001441336 500__ $$aInternational conference proceedings.
001441336 500__ $$aIncludes author index.
001441336 5050_ $$aRouting 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.
001441336 506__ $$aAccess limited to authorized users.
001441336 520__ $$aThis 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.
001441336 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed December 17, 2021).
001441336 650_0 $$aMathematical optimization$$vCongresses.
001441336 650_0 $$aCombinatorial optimization$$xData processing$$vCongresses.
001441336 650_0 $$aComputer science$$xMathematics$$vCongresses.
001441336 650_6 $$aOptimisation mathématique$$vCongrès.
001441336 650_6 $$aOptimisation combinatoire$$xInformatique$$vCongrès.
001441336 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001441336 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001441336 655_7 $$aConference papers and proceedings.$$2lcgft
001441336 655_7 $$aActes de congrès.$$2rvmgf
001441336 655_0 $$aElectronic books.
001441336 7001_ $$aDu, Dingzhu,$$eeditor.
001441336 7001_ $$aDu, Donglei,$$eeditor.
001441336 7001_ $$aWu, Chenchen,$$eeditor.
001441336 7001_ $$aXu, Dachuan$$c(Computer scientist),$$eeditor.
001441336 77608 $$iPrint version:$$aCOCOA (Conference) (15th : 2021 : Tianjin, China).$$tCombinatorial optimization and applications.$$dCham : Springer, [2021]$$z303092680X$$z9783030926809$$w(OCoLC)1285161888
001441336 830_0 $$aLecture notes in computer science ;$$v13135.
001441336 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001441336 852__ $$bebk
001441336 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-92681-6$$zOnline Access$$91397441.1
001441336 909CO $$ooai:library.usi.edu:1441336$$pGLOBAL_SET
001441336 980__ $$aBIB
001441336 980__ $$aEBOOK
001441336 982__ $$aEbook
001441336 983__ $$aOnline
001441336 994__ $$a92$$bISE