Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II de Weili Wu

Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II: Lecture Notes in Computer Science, cartea 14462

Editat de Weili Wu, Jianxiong Guo
en Limba Engleză Paperback – 9 dec 2023
The two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023.  The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: 
Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;
Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 48559 lei  6-8 săpt.
  Springer Nature Switzerland – 9 dec 2023 48559 lei  6-8 săpt.
  Springer Nature Switzerland – 9 dec 2023 54396 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 48559 lei

Preț vechi: 60699 lei
-20% Nou

Puncte Express: 728
Preț estimativ în valută:
9292€ • 9586$ • 7754£

Carte tipărită la comandă

Livrare economică 27 martie-10 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031496134
ISBN-10: 3031496132
Ilustrații: XVIII, 497 p. 119 illus., 71 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.72 kg
Ediția:1st ed. 2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Modeling and Algorithms.- ​Differentiable Discrete Optimization using Dataless Neural Networks.- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model.- Twin-treewidth: A single-exponential logic-based approach.- Highway Preferential Attachment Models for Geographic Routing.- Complexity and Approximation.- Restricted Holant Dichotomy on Domains 3 and 4.- Earliest Deadline First is a $2$-approximation for DARP with Time Windows.- Improved approximation for broadcasting in k-Path Graphs.- The fine-grained complexity of approximately counting proper connected colorings (extended abstract).- Combinatorics and Computing.- Strong edge coloring of subquartic graphs.- Two multicolor Ramsey numbers involving bipartite graphs.- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets.- Computing random r-orthogonal Latin squares.- Optimization and Algorithms.- A Two-stage SeedsAlgorithm for Competitive Influence Maximization considering User Demand.- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems.- Testing Higher-order Clusterability on graphs.- The $2$-mixed-center color spanning problem.- A Dynamic Parameter Adaptive Path Planning Algorithm.- On the Mating Between a Polygonal Curve and a Convex Polygon.- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion.- Multi-Winner Approval Voting with Grouped Voters.- EFX Allocation to Chores Over Small Graph.- Extreme Graph and Others.- Zero-visibility Cops and Robber game on Cage graph.- Online Facility Assignment  for General Layout of Servers on a Line.- Guarding Precise and Imprecise Polyhedral Terrains with Segments.- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition.- On Problems Related to Absent Subsequences.- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs.- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints.- Critical $(P_5,dart)$-Free Graphs.- Graph Clustering through Users' Properties and Social Influence.- Machine Learning, Blockchain and Others.- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection.- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms.- Information Theory of Blockchain Systems.- Machine Learning with Low Resource Data from Psychiatric Clinics.- Single Image Dehazing Based on Dynamic Convolution and Transformer.- Reinforcement Learning for Combating Cyberbullying in Online Social Networks.