國立虎尾科技大學 |

Frontiers of algorithmics = 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Frontiers of algorithmics/ edited by Minming Li, Xiaoming Sun, Xiaowei Wu.
Reminder of title:	17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings /
remainder title:	IJTCS-FAW 2023
other author:	Li, Minming.
corporate name:	Workshop on the Preservation of Stability under Discretization
Published:	Cham :Springer Nature Switzerland : : 2023.,
Description:	xx, 296 p. :ill. (some col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
Subject:	Computer algorithms - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-39344-0
ISBN:	9783031393440

Frontiers of algorithmics = 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings /
Frontiers of algorithmics17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings /[electronic resource] :IJTCS-FAW 2023edited by Minming Li, Xiaoming Sun, Xiaowei Wu. - Cham :Springer Nature Switzerland :2023. - xx, 296 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,139330302-9743 ;. - Lecture notes in computer science ;6140..

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.

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.

ISBN: 9783031393440

Standard No.: 10.1007/978-3-031-39344-0doiSubjects--Topical Terms:

528474
Computer algorithms
--Congresses.

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

Dewey Class. No.: 005.1

Frontiers of algorithmics = 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings /
LDR:04026nam a2200373 a 4500 001 1115934
003 DE-He213
005 20230825211819.0
006 m d
007 cr nn 008maaau
008 240123s2023 sz s 0 eng d
020 $a 9783031393440 $q (electronic bk.)
020 $a 9783031393433 $q (paper)
024 7 $a 10.1007/978-3-031-39344-0 $2 doi
035 $a 978-3-031-39344-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b I58 2023
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $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 2023
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 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 : proceedings / $c edited by Minming Li, Xiaoming Sun, Xiaowei Wu.
246 3 $a IJTCS-FAW 2023
260 $a Cham : $c 2023. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xx, 296 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13933
505 0 $a 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.
520 $a 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.
650 0 $a Computer algorithms $v Congresses. $3 528474
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Engineering and Networks. $3 1365733
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
700 1 $a Li, Minming. $e editor. $3 1267037
700 1 $a Sun, Xiaoming. $3 1206998
700 1 $a Wu, Xiaowei. $3 1428908
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-3-031-39344-0
950 $a Computer Science (SpringerNature-11645)