001476345 000__ 05405cam\\22006257i\4500
001476345 001__ 1476345
001476345 003__ OCoLC
001476345 005__ 20231003174644.0
001476345 006__ m\\\\\o\\d\\\\\\\\
001476345 007__ cr\un\nnnunnun
001476345 008__ 230829s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001476345 020__ $$a9783031393440$$q(electronic bk.)
001476345 020__ $$a3031393449$$q(electronic bk.)
001476345 020__ $$z9783031393433
001476345 0247_ $$a10.1007/978-3-031-39344-0$$2doi
001476345 035__ $$aSP(OCoLC)1395506922
001476345 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dOCLCO
001476345 049__ $$aISEA
001476345 050_4 $$aQA76.9.A43$$bI58 2023eb
001476345 08204 $$a005.1$$223/eng/20230829
001476345 1112_ $$aIJTCS-FAW (Conference)$$d(2023 :$$cMacau, China)
001476345 24510 $$aFrontiers of algorithmics :$$b17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 Proceedings /$$cMinming Li, Xiaoming Sun, Xiaowei Wu, editors.
001476345 2463_ $$aIJTCS-FAW 2023
001476345 264_1 $$aCham, Switzerland :$$bSpringer,$$c2023.
001476345 300__ $$a1 online resource (xx, 296 pages) :$$billustrations (some color).
001476345 336__ $$atext$$btxt$$2rdacontent
001476345 337__ $$acomputer$$bc$$2rdamedia
001476345 338__ $$aonline resource$$bcr$$2rdacarrier
001476345 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13933
001476345 500__ $$aIncludes author index.
001476345 5050_ $$aUnderstanding 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.
001476345 506__ $$aAccess limited to authorized users.
001476345 520__ $$aThis 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.
001476345 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 29, 2023).
001476345 650_0 $$aComputer algorithms$$vCongresses.
001476345 650_6 $$aAlgorithmes$$vCongrès.
001476345 655_0 $$aElectronic books.
001476345 7001_ $$aLi, Minming,$$eeditor.
001476345 7001_ $$aSun, Xiaoming$$c(Computer scientist),$$eeditor.$$1https://orcid.org/0000-0002-0281-1670
001476345 7001_ $$aWu, Xiaowei,$$eeditor.$$0(orcid)0000-0002-5766-2115$$1https://orcid.org/0000-0002-5766-2115
001476345 830_0 $$aLecture notes in computer science ;$$v13933.$$x1611-3349
001476345 852__ $$bebk
001476345 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-39344-0$$zOnline Access$$91397441.1
001476345 909CO $$ooai:library.usi.edu:1476345$$pGLOBAL_SET
001476345 980__ $$aBIB
001476345 980__ $$aEBOOK
001476345 982__ $$aEbook
001476345 983__ $$aOnline
001476345 994__ $$a92$$bISE