Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)
13%
Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)

Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

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.


Best Sellers


Product Details
  • ISBN-13: 9789819610891
  • Publisher: Springer Nature Switzerland AG
  • Publisher Imprint: Springer Nature Switzerland AG
  • Height: 235 mm
  • No of Pages: 573
  • Series Title: 15161 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 9819610893
  • Publisher Date: 06 Mar 2025
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)
Springer Nature Switzerland AG -
Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computing and Combinatorics: 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I(15161 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA