LEADER 05552nam 22008175 450 001 9910983370203321 005 20251113180332.0 010 $a9789819777525 010 $a9819777526 024 7 $a10.1007/978-981-97-7752-5 035 $a(MiAaPQ)EBC31862546 035 $a(Au-PeEL)EBL31862546 035 $a(CKB)37095387800041 035 $a(DE-He213)978-981-97-7752-5 035 $a(OCoLC)1483962111 035 $a(EXLCZ)9937095387800041 100 $a20241229d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers of Algorithmics $e18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024, Proceedings /$fedited by Bo Li, Minming Li, Xiaoming Sun 205 $a1st ed. 2025. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2025. 215 $a1 online resource (347 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14752 311 08$a9789819777518 311 08$a9819777518 327 $a -- On the Problem of Best Arm Retention. -- Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem. -- On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. -- How to Play Old Maid with Virtual Players. -- Algorithms for Optimally Shifting Intervals under Intersection Graph Models. -- On the Fine-grained Complexity of Approximating Max k-Coverage. -- Nested and Interleaved Ticketing for Multiple Travelers. -- Longest (k]-tuple Common Substrings. -- Scheduling two types of jobs with minimum makespan. -- Blockchain Technology for Digital Asset Ownership. -- On the Optimal Mixing Problem of Approximate Nash Equilibria in Bimatrix Games. -- Finding Fair and Efficient Allocations Under Budget Constraints. -- Computations and Complexities of Tarski?s Fixed Points and Supermodular Games. -- Parity-Constrained k-Supplier Problem. -- Approximating Principal-Agent Problem under Bayesian. -- Robust Facility Leasing Problem with Penalties. -- Randomized Strategyproof Mechanisms for Multi-stage Facility Location Problem with Capacity Constraints. -- From Evolutionary Game Dynamics to Non-negative Matrix Factorization: Acceleration with Hessian Geometry. -- A case for Copeland: from theory to practice. -- Deterministic and Universal Truthful Mechanism for Fair Matching. -- Equilibrium Strategies of Carbon Emission Reduction in Agricultural Product Supply Chain under Carbon Sink Trading. -- Active Learning Supported Iterative Combinatorial Auctions. -- Locating Two Facilities on a Square with a Minimum Distance Requirement. 330 $aThis book constitutes the refereed proceedings of the 18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), consisting of the 18th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 5th International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, SAR, China, during July 29-31, 2024. 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 20 full papers and 3 short papers included in this book were carefully reviewed and selected from 43 submissions. They focused tracks on algorithms, blockchain theory, computational economics and algorithmic game theory. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14752 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aData structures (Computer science) 606 $aInformation theory 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 Communication 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 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 Communication Networks. 615 24$aSoftware Engineering. 615 24$aDesign and Analysis of Algorithms. 676 $a004.0151 700 $aLi$b Bo$0645181 701 $aLi$b Minming$01423621 701 $aSun$b Xiaoming$f1955-$01233993 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910983370203321 996 $aFrontiers of Algorithmics$94462637 997 $aUNINA