Delwedd Flaen

Frontiers of Algorithmics 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings /

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 Conferenc...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Awdur Corfforaethol: SpringerLink (Online service)
Awduron Eraill: Li, Minming (Golygydd), Sun, Xiaoming (Golygydd), Wu, Xiaowei (Golygydd)
Fformat: Electronig eLyfr
Iaith:Saesneg
Cyhoeddwyd: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Rhifyn:1st ed. 2023.
Cyfres:Lecture Notes in Computer Science, 13933
Pynciau:
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.
Mynediad Ar-lein:https://doi.org/10.1007/978-3-031-39344-0
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Tabl Cynhwysion:
  • 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.

Eitemau Tebyg