LEADER 01046oam 2200325zu 450 001 9911006837403321 005 20210807003357.0 035 $a(CKB)111056552540752 035 $a(SSID)ssj0000072374 035 $a(PQKBManifestationID)11110308 035 $a(PQKBTitleCode)TC0000072374 035 $a(PQKBWorkID)10095699 035 $a(PQKB)10661858 035 $a(EXLCZ)99111056552540752 100 $a20160829d2003 uy 101 0 $aeng 181 $ctxt 182 $cc 183 $acr 200 10$aInternational Critical Tables of Numerical Data, Physics, Chemistry and Technology 210 31$a[Place of publication not identified]$cKnovel Corporation$d2003 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a1-59124-491-9 606 $aChemistry$xChemical Engineering 615 4$aChemistry$xChemical Engineering 801 0$bPQKB 906 $aBOOK 912 $a9911006837403321 996 $aINTERNATIONAL Critical Tables of Numerical Data, Physics, Chemistry and technology$9134480 997 $aUNINA LEADER 06326nam 22008295 450 001 996647970403316 005 20251116222317.0 010 $a9789819610907 010 $a9819610907 024 7 $a10.1007/978-981-96-1090-7 035 $a(CKB)37776398800041 035 $a(MiAaPQ)EBC31943577 035 $a(Au-PeEL)EBL31943577 035 $a(OCoLC)1511109536 035 $a(DE-He213)978-981-96-1090-7 035 $a(EXLCZ)9937776398800041 100 $a20250305d2025 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputing and Combinatorics $e30th International Conference, COCOON 2024, Shanghai, China, August 23?25, 2024, Proceedings, Part I /$fedited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang 205 $a1st ed. 2025. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2025. 215 $a1 online resource (1099 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15161 311 08$a9789819610891 311 08$a9819610893 327 $a -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbb{Z}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs. 330 $aThis three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23?25, 2024. The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15161 606 $aComputer science 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aTheory of Computation 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aNumerical Analysis 615 0$aComputer science. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aTheory of Computation. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aNumerical Analysis. 676 $a004.0151 700 $aChen$b Yong$0922822 701 $aGao$b Xiaofeng$01784932 701 $aSun$b Xiaoming$f1955-$01233993 701 $aZhang$b An$01784933 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996647970403316 996 $aComputing and Combinatorics$94524116 997 $aUNISA