Frontiers of Algorithmics

17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14¿18, 2023 Proceedings
Herausgegeben:Li, Minming; Sun, Xiaoming; Wu, Xiaowei

• Broschiertes Buch

Produktbeschreibung

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

Produktdetails

• Lecture Notes in Computer Science 13933
• Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
• Artikelnr. des Verlages: 978-3-031-39343-3
• 1st ed. 2023
• Seitenzahl: 316
• Erscheinungstermin: 26. August 2023
• Englisch
• Abmessung: 235mm x 155mm x 18mm
• Gewicht: 482g
• ISBN-13: 9783031393433
• ISBN-10: 3031393430
• Artikelnr.: 68308777

Inhaltsangabe

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