Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
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
| 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 |
| Autore | Li Minming |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (312 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
SunXiaoming
WuXiaowei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
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 |
| ISBN | 3-031-39344-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996546850103316 |
Li Minming
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmics : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu
| Frontiers of Algorithmics : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu |
| Autore | Li Minming |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (312 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
SunXiaoming
WuXiaowei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
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 |
| ISBN |
9783031393440
3031393449 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910742499603321 |
|
Li Minming
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||