000 05646nam a22006615i 4500
001 978-3-031-20350-3
003 DE-He213
005 20240730165016.0
007 cr nn 008mamaa
008 221220s2022 sz | s |||| 0|eng d
020 _a9783031203503
_9978-3-031-20350-3
024 7 _a10.1007/978-3-031-20350-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aTheory and Applications of Models of Computation
_h[electronic resource] :
_b17th Annual Conference, TAMC 2022, Tianjin, China, September 16-18, 2022, Proceedings /
_cedited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIII, 416 p. 50 illus., 25 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 ;
_v13571
505 0 _aMaximization of $k$-Submodular Function with a Matroid Constraint -- Maximizing Approximately Non-$k$-Submodular Monotone Set Function with Matroid Constraint -- Time-of-Use Scheduling Problem With Equal-Length Jobs -- Online Non-Submodular and Non-Convex Optimization with Stochastic Long-Term Constraints -- Physical ZKP for Makaro Using a Standard Deck of Cards -- Characterization of the Imbalance Problem on Complete Bipartite Graphs -- New Algorithms for a Simple Measure of Network Partitioning -- On Two Types of Concept Lattices in the Theory of Numberings -- Computing Connected-$k$-Subgraph Cover with Connectivity Requirement -- Analyzing the $3$-Path Vertex Cover Problem in Planar Bipartite Graphs -- Competition-Based Generalized Self-profit Maximization in Dual-Attribute Networks -- Largest Convex Hull for Constant Size, Convex-Hull Disjoint Clusters -- Two-Stage Submodular Maximization Under Knapsack Problem -- (Z, succ, U), (Z, E, U), and their CSP's -- Circle Graph Isomorphism in Almost Linear Time -- The Exact Subset MultiCover Problem -- Hide a Liar: Card-Based ZKP Protocol for Usowan -- Complexity Analysis of a Stochastic Variant of Generalized Alternating Direction Method of Multipliers -- A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem -- Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs -- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees -- Two-Stage Non-Submodular Maximization -- Fault-Tolerant Total Domination via Submodular Function Approximation -- On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems -- Extracting Densest Sub-Hypergraph with Convex Edge-Weight Functions -- Exact and Approximation Algorithms for PMMS Under Identical Constraints -- Finite-State Relative Dimension, Dimensions of AP Subsequences and a Finite-State van Lambalgen's Theorem -- Distributed Connected Dominating Sets in Unit Square andDisk Graphs -- An Inventory System Optimization for Solving Joint Pricing and Ordering Problem with Trapezoidal Demand and Partial Backlogged Shortages in a Limited Sales Period -- A Set-Theoretic Representation of Algebraic L-Domains -- Normality, Randomness and Kolmogorov Complexity of Continued Fractions -- Weakly $k$-Submodular Maximization Under Matroid Constraint -- Approximation Algorithms for Diversity-Bounded Center Problems. .
520 _aThis book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022. The 33 full papers were carefully reviewed and selected from 75 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.
650 0 _aAlgorithms.
_93390
650 0 _aNumerical analysis.
_94603
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 0 _aImage processing
_xDigital techniques.
_94145
650 0 _aComputer vision.
_987051
650 1 4 _aAlgorithms.
_93390
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aMathematical Applications in Computer Science.
_931683
650 2 4 _aTheory of Computation.
_987053
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
_931569
700 1 _aDu, Ding-Zhu.
_eeditor.
_0(orcid)
_10000-0002-7345-2185
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_987055
700 1 _aDu, Donglei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_987056
700 1 _aWu, Chenchen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_987058
700 1 _aXu, Dachuan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_987060
710 2 _aSpringerLink (Online service)
_987062
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031203497
776 0 8 _iPrinted edition:
_z9783031203510
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13571
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-20350-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86044
_d86044