DAU Library

전자책

Frontiers of Algorithmics[electronic resource] :18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024, Proceedings /edited by Bo Li, Minming Li, Xiaoming Sun

Li Bo. editor Li Minming. editor Sun Xiaoming. editor

1st ed. 2025.

XII, 336 p 62 illus, 38 illus in color online resource.

This 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.

/ 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.

9789819777525

바로가기