Buch, Englisch, 189 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 324 g
17th International Conference, COCOA 2024, Beijing, China, December 6-8, 2024, Proceedings, Part II
Buch, Englisch, 189 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 324 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-981-964447-6
Verlag: Springer Nature Singapore
The two-volume set, LNCS 15434 and 15435, constitutes the refereed post-conference proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2024, held in Beijing, China, during December 6–8, 2024.
The 53 full papers included in the proceedings were carefully reviewed and selected from 124 submissions. They deal with combinatorial optimization and its applications, including algorithm design, theoretical and experimental analysis, and applied research of general algorithmic interest.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
.-Maximizing One-Way Trading Revenue in Photovoltaic Energy Generation.
.- Parameterized Complexity of Shortest Path with Positive Disjunctive Constraint.
.- An Approximation Algorithm for the (Metric) Clustered Path Traveling Salesman Problem.
.- Dynamic Algorithms for Submodular Maximization with a $p$-Matchoid Constraint.
.- Generative Flow Networks with Symmetry Enhancement to Solve Vehicle Routing Problems.
.- Edge-Unfolding Polycubes with Orthogonally Convex Layers.
.- B-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets.
.- Mechanism Design for Facility Location Games Under a Prelocated Facility.
.- Computing approximate mixed Nash equilibria for symmetric weighted congestion games.
.- Dynamic Algorithms for Non-monotone Submodular Maximization.
.- Broadcasting and three list subtraction.
.- The Power of Second Chance: Personalized Submodular Maximization with Two Candidates.
.- (Independent) Roman Domination Parameterized by Distance to Cluster.
.- Fair selection of clearing schemes for kidney exchange markets.
