소장자료
| LDR | 05499nam a22006855i 4500 | ||
| 001 | 0100794249▲ | ||
| 003 | DE-He213▲ | ||
| 005 | 20240305105558▲ | ||
| 007 | cr nn 008mamaa▲ | ||
| 008 | 230825s2023 sz | s |||| 0|eng d▲ | ||
| 020 | ▼a9783031393440▼9978-3-031-39344-0▲ | ||
| 024 | 7 | ▼a10.1007/978-3-031-39344-0▼2doi▲ | |
| 050 | 4 | ▼aQA76.9.M35▲ | |
| 050 | 4 | ▼aQA297.4▲ | |
| 082 | 0 | 4 | ▼a004.0151▼223▲ |
| 245 | 1 | 0 | ▼aFrontiers of Algorithmics▼h[electronic resource] :▼b17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings /▼cedited by Minming Li, Xiaoming Sun, Xiaowei Wu.▲ |
| 250 | ▼a1st ed. 2023.▲ | ||
| 264 | 1 | ▼aCham :▼bSpringer Nature Switzerland :▼bImprint: Springer,▼c2023.▲ | |
| 300 | ▼aXX, 296 p. 46 illus., 19 illus. in color.▼bonline resource.▲ | ||
| 336 | ▼atext▼btxt▼2rdacontent▲ | ||
| 337 | ▼acomputer▼bc▼2rdamedia▲ | ||
| 338 | ▼aonline resource▼bcr▼2rdacarrier▲ | ||
| 347 | ▼atext file▼bPDF▼2rda▲ | ||
| 490 | 1 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v13933▲ | |
| 505 | 0 | ▼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.▲ | |
| 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.▲ | ||
| 650 | 0 | ▼aComputer science▼xMathematics.▲ | |
| 650 | 0 | ▼aDiscrete mathematics.▲ | |
| 650 | 0 | ▼aNumerical analysis.▲ | |
| 650 | 0 | ▼aData structures (Computer science).▲ | |
| 650 | 0 | ▼aInformation theory.▲ | |
| 650 | 0 | ▼aComputer engineering.▲ | |
| 650 | 0 | ▼aComputer networks .▲ | |
| 650 | 0 | ▼aSoftware engineering.▲ | |
| 650 | 0 | ▼aAlgorithms.▲ | |
| 650 | 1 | 4 | ▼aDiscrete Mathematics in Computer Science.▲ |
| 650 | 2 | 4 | ▼aNumerical Analysis.▲ |
| 650 | 2 | 4 | ▼aData Structures and Information Theory.▲ |
| 650 | 2 | 4 | ▼aComputer Engineering and Networks.▲ |
| 650 | 2 | 4 | ▼aSoftware Engineering.▲ |
| 650 | 2 | 4 | ▼aDesign and Analysis of Algorithms.▲ |
| 700 | 1 | ▼aLi, Minming.▼eeditor.▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 700 | 1 | ▼aSun, Xiaoming.▼eeditor.▼0(orcid)0000-0002-0281-1670▼1https://orcid.org/0000-0002-0281-1670▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 700 | 1 | ▼aWu, Xiaowei.▼eeditor.▼0(orcid)0000-0002-5766-2115▼1https://orcid.org/0000-0002-5766-2115▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 710 | 2 | ▼aSpringerLink (Online service)▲ | |
| 773 | 0 | ▼tSpringer Nature eBook▲ | |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783031393433▲ |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783031393457▲ |
| 830 | 0 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v13933▲ | |
| 856 | 4 | 0 | ▼uhttps://doi.org/10.1007/978-3-031-39344-0▲ |
Frontiers of Algorithmics[electronic resource] : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings
자료유형
국외eBook
서명/책임사항
Frontiers of Algorithmics [electronic resource] : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / edited by Minming Li, Xiaoming Sun, Xiaowei Wu.
판사항
1st ed. 2023.
형태사항
XX, 296 p. 46 illus., 19 illus. in color. online resource.
총서사항
Lecture Notes in Computer Science , 1611-3349 ; 13933
Lecture Notes in Computer Science , 1611-3349 ; 13933
Lecture Notes in Computer Science , 1611-3349 ; 13933
내용주기
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.
주제
Computer science, Mathematics.
Discrete mathematics.
Numerical analysis.
Data structures (Computer science).
Information theory.
Computer engineering.
Computer networks .
Software engineering.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Data Structures and Information Theory.
Computer Engineering and Networks.
Software Engineering.
Design and Analysis of Algorithms.
Discrete mathematics.
Numerical analysis.
Data structures (Computer science).
Information theory.
Computer engineering.
Computer networks .
Software engineering.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Data Structures and Information Theory.
Computer Engineering and Networks.
Software Engineering.
Design and Analysis of Algorithms.
ISBN
9783031393440
관련 인기대출 도서