Muutke küpsiste eelistusi

Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 68, 2024, Proceedings, Part II [Pehme köide]

Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 189 pages, kõrgus x laius: 235x155 mm, 20 Illustrations, color; 5 Illustrations, black and white; XVI, 189 p. 25 illus., 20 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15435
  • Ilmumisaeg: 04-May-2025
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 981964447X
  • ISBN-13: 9789819644476
Teised raamatud teemal:
  • Pehme köide
  • Hind: 141,35 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 166,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 68, 2024, Proceedings, Part IISuurem pilt
  • Formaat: Paperback / softback, 189 pages, kõrgus x laius: 235x155 mm, 20 Illustrations, color; 5 Illustrations, black and white; XVI, 189 p. 25 illus., 20 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15435
  • Ilmumisaeg: 04-May-2025
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 981964447X
  • ISBN-13: 9789819644476
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9789819644476.html
Märksõnad:

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.

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