000 06144nam a22006615i 4500
001 978-3-031-22105-7
003 DE-He213
005 20240423125143.0
007 cr nn 008mamaa
008 221217s2022 sz | s |||| 0|eng d
020 _a9783031221057
_9978-3-031-22105-7
024 7 _a10.1007/978-3-031-22105-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputing and Combinatorics
_h[electronic resource] :
_b28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings /
_cedited by Yong Zhang, Dongjing Miao, Rolf Möhring.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIV, 586 p. 92 illus., 48 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13595
505 0 _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(n^3)$-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 $\mathbb{Z}^d$ -- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering -- Proper colorability of segment intersection graphs.
520 _aChapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 0 _aComputer science.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aImage processing
_xDigital techniques.
650 0 _aComputer vision.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 1 4 _aTheory of Computation.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 2 4 _aData Structures and Information Theory.
700 1 _aZhang, Yong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMiao, Dongjing.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMöhring, Rolf.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031221040
776 0 8 _iPrinted edition:
_z9783031221064
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13595
856 4 0 _uhttps://doi.org/10.1007/978-3-031-22105-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c174840
_d174840