國立虎尾科技大學 |

Frontiers of algorithmics = 18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Frontiers of algorithmics/ edited by Bo Li, Minming Li, Xiaoming Sun.
其他題名:	18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings /
其他題名:	IJTCS-FAW 2024
其他作者:	Sun, Xiaoming.
團體作者:	Workshop on the Preservation of Stability under Discretization
出版者:	Singapore :Springer Nature Singapore : : 2025.,
面頁冊數:	xii, 336 p. :ill. (some col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Design and Analysis of Algorithms. -
電子資源:	https://doi.org/10.1007/978-981-97-7752-5
ISBN:	9789819777525

Frontiers of algorithmics = 18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings /
Frontiers of algorithmics18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings /[electronic resource] :IJTCS-FAW 2024edited by Bo Li, Minming Li, Xiaoming Sun. - Singapore :Springer Nature Singapore :2025. - xii, 336 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,147520302-9743 ;. - Lecture notes in computer science ;6140..

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.

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.

ISBN: 9789819777525

Standard No.: 10.1007/978-981-97-7752-5doiSubjects--Topical Terms:

1365721
Design and Analysis of Algorithms.

LC Class. No.: QA76.9.A43 / I58 2024

Dewey Class. No.: 005.1

Frontiers of algorithmics = 18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings /
LDR:04072nam a2200373 a 4500 001 1160230
003 DE-He213
005 20241229115244.0
006 m o d
007 cr nn 008maaau
008 251029s2025 si s 0 eng d
020 $a 9789819777525 $q (electronic bk.)
020 $a 9789819777518 $q (paper)
024 7 $a 10.1007/978-981-97-7752-5 $2 doi
035 $a 978-981-97-7752-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b I58 2024
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b I25 2024
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Frontiers of algorithmics $h [electronic resource] : $b 18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024 : proceedings / $c edited by Bo Li, Minming Li, Xiaoming Sun.
246 3 $a IJTCS-FAW 2024
260 $a Singapore : $c 2025. $b Springer Nature Singapore : $b Imprint: Springer,
300 $a xii, 336 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14752
505 0 $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.
520 $a 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.
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Numerical Analysis. $3 671433
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Computer algorithms $v Congresses. $3 528474
700 1 $a Sun, Xiaoming. $3 1206998
700 1 $a Li, Minming. $e editor. $3 1267037
700 1 $a Li, Bo. $3 1201860
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u https://doi.org/10.1007/978-981-97-7752-5
950 $a Computer Science (SpringerNature-11645)