Combinatorial Optimization and Applications
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I

Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I

|
     0     
5
4
3
2
1




International Edition


About the Book

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. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows:  Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others; Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.

Table of Contents:
Optimization in Graphs.- ​An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs.- Algorithms on a path covering problem with applications in transportation.- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges.- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line.- Online Dominating Set and Coloring.- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets.- Exactly k MSTs: How many vertices suffice?.- Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs.- Scheduling.- Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints.- Two Exact Algorithms for the Packet Scheduling Problem.- Improved Scheduling with a Shared Resource.- An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud.- Set-Related Optimization.- Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces.- The MaxIS-Shapley Value in Perfect Graphs.- Asteroidal Sets and Dominating Paths.- A Novel Approximation Algorithm for Max-Covering Circle Problem.- GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks.- Simple Heuristics for the Rooted Max Tree Coverage Problem.- Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints.- Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization.- Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization.- Applied Optimization and Algorithm.- Improved Lower Bound for Estimating the Number of Defective Items.- Popularity on the Roommate Diversity Problem.- On Half Guarding Polygons.- Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem.- Algorithms for the Ridesharing with Profit Constraint Problem.- Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms.- Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs.- The Line-constrained Maximum Coverage Facility Location Problem.- Graph Planer and Others.- On Connectedness of Solutions to Integer Linear Systems.- An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem.- The Longest Subsequence-Repeated Subsequence Problem.- An Approximation Algorithm for Covering Vertices by 4^+-Paths.- V-Words, Lyndon Words and Substring circ-UMFFs.- The Two-Center Problem of Uncertain Points on Trees.- Space-Time Graph Planner for Unsignalized Intersections with CAVs.- The Two Sheriffs Problem: Cryptographic Formalization and Generalization.


Best Sellers


Product Details
  • ISBN-13: 9783031496103
  • Publisher: Springer International Publishing AG
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I
  • ISBN-10: 3031496108
  • Publisher Date: 09 Dec 2023
  • Height: 235 mm
  • No of Pages: 527
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I
Springer International Publishing AG -
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, 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: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, 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!