Computing and Combinatorics
30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I
Series: Lecture Notes in Computer Science; 15161;
- Publisher's listprice EUR 87.73
-
36 386 Ft (34 653 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 7 277 Ft off)
- Discounted price 29 109 Ft (27 722 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
36 386 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Singapore
- Date of Publication 6 March 2025
- Number of Volumes 1 pieces, Book
- ISBN 9789819610891
- Binding Paperback
- No. of pages573 pages
- Size 235x155 mm
- Language English
- Illustrations XXII, 573 p. 106 illus., 52 illus. in color. Illustrations, black & white 634
Categories
Long description:
This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024.
The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing.
Table of Contents:
.- Can the 1.375 approximation ratio of unsigned genomes distances be improved?.
.- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths.
.- On Extensions of Min-k-Union.
.- Sublinear Algorithms for Scheduling with Chain Precedence Constraints.
.- Bicriteria approximation algorithms for the unit disk coverage problem.
.- Private Neural Network Training with Packed Secret Sharing.
.- k-Balanced Biclique Partition on Signed Bipartite Graphs.
.- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions.
.- On Sorting Signed Permutations by Flanked DCJs.
.- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two.
.- Relations between monotone complexity measures based on decision tree complexity.
.- Minimum sum vertex cover: kernelization and parameterized algorithms.
.- Facility location game for maximizing the social satisfaction on a line.
.- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line.
.- MPMD on Two Sources with Lookahead.
.- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling.
.- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design.
.- 1.6-approximation algorithm for generalized traveling salesman path probem.
.- Assortment Planning with Sponsored Products.
.- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam.
.- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems.
.- The Complexity of Distance-$r$ Dominating Set Reconfiguration.
.- A characterization of uniquely representable two-directional orthogonal ray graphs.
.- The complexity of strong confl?ict-free vertex-connection k-colorability.
.- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset.
.- Bipartite domination in outerplanar graphs.
.- Robust Matroid Bandit Optimization against Adversarial Contamination.
.- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism.
.- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging.
.- Maximin Share Allocation under Knapsack Constraint.
.- On the Minimum Edge Bisection of Graph.
.- Random Schreier graphs as expanders.
.- Direct Sum Theorems From Fortification.
.- On Sorting by Unsigned Symmetric Reversals.
.- Some Results on Critical ($P_5,H$)-free Graphs.
.- Single machine lot scheduling to minimize maximum weighted completion time.
.- A Quadratic Vertex Kernel for Diamond-free Edge Deletion.
.- Graph convexity partizan games.
.- Almost optimum $\ell$-covering of $\mathbb{Z}_n$.
.- The Communication Complexity of Distributed Maximization.
.- Approximately Covering Vertices by Order-5 or Longer Paths.
.- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering.
.- A Little Aggression Goes a Long Way.
.- Monotone Properties of Uncertain Graphs.
English Grammar in Use with answers and CD-ROM and Cambridge Learner's Dictionary with CD-ROM
15 049 HUF
13 544 HUF
