001452084 000__ 06006cam\a22005417i\4500
001452084 001__ 1452084
001452084 003__ OCoLC
001452084 005__ 20230310003340.0
001452084 006__ m\\\\\o\\d\\\\\\\\
001452084 007__ cr\cn\nnnunnun
001452084 008__ 230109s2023\\\\sz\a\\\\ob\\\\100\0\eng\d
001452084 019__ $$a1356795403$$a1356796974$$a1357018630
001452084 020__ $$a9783031221057$$qelectronic book
001452084 020__ $$a3031221052$$qelectronic book
001452084 020__ $$z9783031221040
001452084 020__ $$z3031221044
001452084 0247_ $$a10.1007/978-3-031-22105-7$$2doi
001452084 035__ $$aSP(OCoLC)1357119825
001452084 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dYDX$$dOCLCQ$$dBRX$$dUKAHL
001452084 049__ $$aISEA
001452084 050_4 $$aQA164$$b.C63 2022
001452084 08204 $$a511/.6$$223/eng/20230109
001452084 1112_ $$aCOCOON (Conference)$$n(28th :$$d2022 :$$cShenzen Shi, China)
001452084 24510 $$aComputing and combinatorics :$$b28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, proceedings /$$cYong Zhang, Dongjing Miao, Rolf Möhring (eds.).
001452084 264_1 $$aCham :$$bSpringer,$$c2023.
001452084 300__ $$a1 online resource (1 volume) :$$billustrations
001452084 336__ $$atext$$btxt$$2rdacontent
001452084 337__ $$acomputer$$bc$$2rdamedia
001452084 338__ $$aonline resource$$bcr$$2rdacarrier
001452084 4901_ $$aLecture notes in computer science ;$$v13595
001452084 504__ $$aIncludes bibliographical references.
001452084 5050_ $$aA stochastic algorithm for non-monotone DR-submodular maximziation over a convex set -- Flow shop scheduling problems with transportation constraints revisited -- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams -- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants -- Large k-gons in a 1.5D Terrain -- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits (Extended Abstract).-Analysis of Approximate sorting in I/O model.-Two Generalizations of Proper Coloring: Hardness and Approximability.-Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems.-On the Complexity of Minimum Maximal Acyclic Matchings.-Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret.-Fair Division with Minimal Withheld Information in Social Networks -- Facility Location Games with Ordinal Preferences.-Fully Dynamic k-Center Clustering with Outliers.-Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search.-Online one-sided smooth function maximization.-Revisiting Maximum Satisfiability and Related Problems in Data Streams.-Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity -- A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case.-Single machine scheduling with rejection to minimize the k-th power of the makespan -- Escape from the Room -- Algorithms for hard-constraint point processes via discretization.-Space Limited Graph Algorithms on Big Data Counting Cycles on Planar Graphs in Subexponential Time.-Semi-strict chordal digraphs -- Reallocation Problems with Minimum Completion Time.-The bound coverage problem by aligned disks in L1 metric.-Facility Location Games with Group Externalities -- Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs -- Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps -- Customizable Hub Labeling: Properties and Algorithms Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs.-Bounding the Number of Eulerian Tours in Undirected Graphs -- A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables -- A 4-Space Bounded -- Approximation Algorithm for Online Bin Packing Problem.-Generalized Sweeping Line Spanners -- Rooting Gene Trees via Phylogenetic Networks -- An evolving network model from clique extension -- Online semi-matching problem with two heterogeneous sensors in a metric space -- Two-Stage BP Maximization under p-matroid Constraint -- The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs -- An O(n3)-Time Algorithm for the Min-Gap -- Unit-Length Job Scheduling Problem -- Approximation Schemes for k-Facility Location -- Improved Deterministic Algorithms for Non-monotone Submodular Maximization -- Distributed Dominating Sets in Interval Graphs -- Optimal Window Queries on Line Segments using the Trapezoidal Search DAG -- On Rotation Distance, Transpositions and Rank Bounded Trees -- Hitting Geometric Objects Online via Points in Zd -- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering -- Proper colorability of segment intersection graphs.
001452084 506__ $$aAccess limited to authorized users.
001452084 520__ $$aThis book constitutes the proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022, held in Shenzhen, China, in October 2022. The 39 full papers together with 12 short papers presented in this volume were carefully reviewed and selected from 101 submissions. The papers focus on subjects such as Algorithmica, Theoretical Computer Science, Journal of Combinatorial Optimization and others.
001452084 650_0 $$aCombinatorial analysis$$xData processing$$vCongresses.
001452084 650_0 $$aComputer science$$xMathematics$$vCongresses.
001452084 655_0 $$aElectronic books.
001452084 7001_ $$aZhang, Yong,$$eeditor.
001452084 7001_ $$aMiao, Dongjing,$$eeditor.
001452084 7001_ $$aMöhring, R. H.$$q(Rolf H.),$$eeditor.$$1https://isni.org/isni/0000000116597292
001452084 77608 $$iPrint version:$$aCOCOON (Conference) (28th : 2022 : Shenzen Shi, China), creator.$$tComputing and combinatorics.$$dCham : Springer, 2023$$z9783031221040$$w(OCoLC)1350635264
001452084 830_0 $$aLecture notes in computer science ;$$v13595.
001452084 852__ $$bebk
001452084 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-22105-7$$zOnline Access$$91397441.1
001452084 909CO $$ooai:library.usi.edu:1452084$$pGLOBAL_SET
001452084 980__ $$aBIB
001452084 980__ $$aEBOOK
001452084 982__ $$aEbook
001452084 983__ $$aOnline
001452084 994__ $$a92$$bISE