Vor Ort
Merkzettel Warenkorb
Produktbild: Computing and Combinatorics
Band 14422 - 12%

Computing and Combinatorics 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I

Aus der Reihe Lecture Notes in Computer Science
12% sparen

76,99 € UVP 87,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.12.2023

Herausgeber

Weili Wu + weitere

Verlag

Springer

Seitenzahl

413

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1st ed. 2024

Sprache

Englisch

ISBN

978-3-031-49189-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.12.2023

Herausgeber

Verlag

Springer

Seitenzahl

413

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1st ed. 2024

Sprache

Englisch

ISBN

978-3-031-49189-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computing and Combinatorics
  • Combinatorics and Algorithms .- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher.- Extended formulations via decision diagrams.- Greedy Gray codes for Dyck words and ballot sequences.- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication.- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences.- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.- An Approach to Agent Path Planning under Temporal Logic Constraints.- The Heterogeneous Rooted Tree Cover Problem.- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model.- The Regularized Submodular Maximization via the Lyapunov Method.- Topological network-control games.- Lower Bounds of Functions on Finite Abelian Groups.- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering.- Random Shortening of Linear Codes and Applications.- Algorithms for Full-View Coverage of Targets with Group Set Cover.- Improved bounds for the binary paint shop problem.- Algorithmic Solution in Applications .- Fitch Graph Completion.- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays.- Diversity and freshness-aware regret minimizing set queries.- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback.- Cabbage Can’t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.- k-median/means with outliers revisited: a simple fpt approximation.- A cost-sharing scheme for the $k$-product facility location game with penalties.-  Algorithm in Networks .- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks.- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty.- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network.- Solving systems of linear equations through zero forcing sets.- Profit Maximization for Competitive Influence Spread in Social Networks.- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing.- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes.- Approval-Based Participatory Budgeting with Donations.