Library Catalog

>>
Library Catalog
>
000 nam5i
001 2210080935934
003 DE-He213
005 20250321105943
007 cr nn 008mamaa
008 250305s2025 si | s |||| 0|eng d
020 a97898196109079978-981-96-1090-7
024 a10.1007/978-981-96-1090-72doi
040 a221008
050 aQA75.5-76.95
072 aUYA2bicssc
072 aCOM0140002bisacsh
072 aUYA2thema
082 a004.0151223
245 00 aComputing and Combinatoricsh[electronic resource] :b30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I /cedited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang.
250 a1st ed. 2025.
264 aSingapore :bSpringer Nature Singapore :bImprint: Springer,c2025.
300 aXXII, 573 p. 106 illus., 52 illus. in color.bonline resource.
336 atextbtxt2rdacontent
337 acomputerbc2rdamedia
338 aonline resourcebcr2rdacarrier
347 atext filebPDF2rda
490 aLecture Notes in Computer Science,x1611-3349 ;v15161
505 a -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing 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- 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.
520 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. .
650 aComputer science.
650 aImage processingxDigital techniques.
650 aComputer vision.
650 aData structures (Computer science).
650 aInformation theory.
650 aComputer sciencexMathematics.
650 aDiscrete mathematics.
650 aNumerical analysis.
650 aTheory of Computation.
650 aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 aData Structures and Information Theory.
650 aDiscrete Mathematics in Computer Science.
650 aSymbolic and Algebraic Manipulation.
650 aNumerical Analysis.
700 aChen, Yong.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aGao, Xiaofeng.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aSun, Xiaoming.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aZhang, An.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
710 aSpringerLink (Online service)
773 tSpringer Nature eBook
776 iPrinted edition:z9789819610891
776 iPrinted edition:z9789819610914
830 aLecture Notes in Computer Science,x1611-3349 ;v15161
856 uhttps://doi.org/10.1007/978-981-96-1090-7
912 aZDB-2-SCS
912 aZDB-2-SXCS
912 aZDB-2-LNC
950 aComputer Science (SpringerNature-11645)
950 aComputer Science (R0) (SpringerNature-43710)
Computing and Combinatorics[electronic resource] :30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I /edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
Material type
전자책
Title
Computing and Combinatorics[electronic resource] :30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I /edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
Author's Name
판 사항
1st ed. 2025.
Physical Description
XXII, 573 p 106 illus, 52 illus in color online resource.
Keyword
This 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. .
관련 URL

Holdings Information

RReservation
MMissing Book Request
CClosed Stack Request
IInter-Campus Loan
CPriority Cataloging
PPrint
Registration no. Call no. Location Mark Location Status Due for return Service
전자자료는 소장사항이 존재하지 않습니다

Book Overview

Full menu