Home > General > Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I
Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I

Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I

          
5
4
3
2
1

International Edition


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.
Quantity:
Add to Wishlist

About the Book

The two-volume set, LNCS 15434 and 15435, constitutes the refereed post-conference proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2024, held in Beijing, China, during December 6–8, 2024. The 53 full papers included in the proceedings were carefully reviewed and selected from 124 submissions. They deal with combinatorial optimization and its applications, including algorithm design, theoretical and experimental analysis, and applied research of general algorithmic interest.

Table of Contents:
.- An Optimization Strategy for Fresh Agricultural Product Supply Chain with Altruistic Preference under Blockchain Technology. .- Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems. .- A Simple Algorithm for Scheduling Unit Jobs with Unknown Number of Machines. .- Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees. .- Reinforcement Learning for Airline Continuous Dynamic Pricing. .- Approximation Algorithms for the Combination of Prize-Collecting Vertex Cover and Scheduling. .- Randomized Mechanisms for Improved Approximation Ratios in Heterogeneous Two-facility Location. .- Comprehensive Multi-view Subspace Clustering with Global-and-Local Representation Learning. .- On the Twin-width of Outerplanar Graphs. .- Maximize an approximate $k$-submodular function under a knapsack constraint. .- A Short Proof and Experimental Study of the Approximation Algorithm for Label s-t Cut. .- Risk-embedded Scheduling of a Virtual Power Plant with Electric Vehicle Parking Lot Considering Carbon Emission Trading. .- On the constrained Steiner strong connectivity augmentation problem. .- Competitive algorithms for online traveling salesman problem on a semi-line. .- On the inapproximability of two-machine open shop scheduling with exact delays. .- Minimum Power Partial Cover with Fairness Constraint. .- Differentially Private Counting Queries on Approximate Shortest Paths. .- Semi-online multiprocessor scheduling with known largest job processing time. .- Acyclically edge color triangle-free toroidal graphs in $\Delta + 2$ colors. .- An Equally-Split Bin Packing Problem. .- The location-routing problem in the pallet pooling system considering carbon emissions. .- Scheduling Fully Parallel Jobs with Integer Units. .- UAV Target Tracking with Bandit-Based Data Fusion. .- Fair Maximization of Monotone Submodular Functions in Data Streams. .- Tournament transitivity of graphs. .- Approximation algorithm for min-max correlation clustering problem with penalties. .- Improved Approximation Algorithm for Individual Fairness k-median. .- The Price of Fairness for Budget-Feasible EF1 Allocations. .- On the min-max heterogeneous weighted delivery problem. .- Exact and Approximate Heuristics for the Multi-Modal Stable Matching with Applications in Industry Chains. .- Budget feasible mechanism for a k-submodular function in the clock auction model. .- Kernel for Proper Helly Circular-arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism. .- Approximately Non-k-submodular Maximization under p-System and l Knapsack Constraints. .- Alternating Lagrangian decomposition combining with branch and pricing for robust and integrated airline aircraft routing and crew pairing. .- A Comparative Analysis of NFT-Based Insurance Claim Management Systems Across EVM-Compatible Blockchain Platforms. .- Attaining Equilibria Using Control Sets. .- Scheduling on parallel-batch machines with rejection and resource matching. .- Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hyper graphs. .- Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs.


Best Sellers


Product Details
  • ISBN-13: 9789819644445
  • Publisher: Springer Nature Switzerland AG
  • Publisher Imprint: Springer Nature Switzerland AG
  • Height: 235 mm
  • No of Pages: 470
  • Sub Title: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I
  • ISBN-10: 9819644445
  • Publisher Date: 19 Apr 2025
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


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
Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I
Springer Nature Switzerland AG -
Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I
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.

Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part I

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!