LEADER 05655nam 22008535 450 001 9910742499603321 005 20230825211819.0 010 $a9783031393440 010 $a3031393449 024 7 $a10.1007/978-3-031-39344-0 035 $a(MiAaPQ)EBC30721369 035 $a(Au-PeEL)EBL30721369 035 $a(DE-He213)978-3-031-39344-0 035 $a(PPN)272259926 035 $a(CKB)28062341200041 035 $a(OCoLC)1395506922 035 $a(EXLCZ)9928062341200041 100 $a20230825d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers of Algorithmics $e17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14?18, 2023 Proceedings /$fedited by Minming Li, Xiaoming Sun, Xiaowei Wu 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (312 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13933 311 08$aPrint version: Li, Minming Frontiers of Algorithmics Cham : Springer,c2023 9783031393433 327 $aUnderstanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions -- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization -- Generalized Sorting with Predictions Revisited -- Eliciting Truthful Reports with Partial Signals in Repeated Games -- On the NP-hardness of two scheduling problems under linear constraints -- On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree -- Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant -- Approximate Core Allocations for Edge Cover Games -- Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints -- Additive Approximation Algorithms for Sliding Puzzle -- Differential Game Analysis for Cooperation Models in Automotive Supply Chain under Low-Carbon Emission Reduction Policies -- Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees -- Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi -- Mechanism Design in Fair Sequencing -- Red-Blue Rectangular Annulus Cover Problem -- Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops -- The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations -- Constrained Graph Searching on Trees -- EFX Allocations Exist for Binary Valuations -- Maximize Egalitarian Welfare for Cake Cutting -- Stackelberg Strategies on Epidemic Containment Games. 330 $aThis book constitutes the refereed proceedings of the 17th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2023), consisting of the 17th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 4th International Joint Conference on Theoretical Computer Science (IJTCS), held in Macau, China, during August 14?18, 2023. FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. The 21 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: algorithmic game theory; algorithms and data structures; combinatorial optimization; and computational economics. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13933 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer engineering 606 $aComputer networks 606 $aSoftware engineering 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Structures and Information Theory 606 $aComputer Engineering and Networks 606 $aSoftware Engineering 606 $aDesign and Analysis of Algorithms 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Structures and Information Theory. 615 24$aComputer Engineering and Networks. 615 24$aSoftware Engineering. 615 24$aDesign and Analysis of Algorithms. 676 $a004 676 $a004 700 $aLi$b Minming$01423621 701 $aSun$b Xiaoming$01423622 701 $aWu$b Xiaowei$01423623 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910742499603321 996 $aFrontiers of Algorithmics$93552036 997 $aUNINA