Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Combinatorial Optimization and Applications

16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II
BuchKartoniert, Paperback
497 Seiten
Englisch
Springererschienen am09.12.20231st ed. 2024
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. They were organized in topical sections as follows: Part I: Optimization in graphs;mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR53,49
BuchKartoniert, Paperback
EUR106,99
BuchKartoniert, Paperback
EUR79,17
BuchKartoniert, Paperback
EUR87,73
E-BookPDF1 - PDF WatermarkE-Book
EUR78,10

Produkt

KlappentextThe 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. They were organized in topical sections as follows: Part I: Optimization in graphs;
Details
ISBN/GTIN978-3-031-49613-4
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2023
Erscheinungsdatum09.12.2023
Auflage1st ed. 2024
ReiheLecture Notes in Computer Science
Seiten497 Seiten
SpracheEnglisch
IllustrationenXVIII, 497 p. 119 illus., 71 illus. in color.
Artikel-Nr.55580345

Inhalt/Kritik

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

Schlagworte