Combinatorial Optimization and Applications (eBook, PDF)

16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I
Redaktion: Wu, Weili; Guo, Jianxiong

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Nature Switzerland
• Seitenzahl: 527
• Erscheinungstermin: 8. Dezember 2023
• Englisch
• ISBN-13: 9783031496110
• Artikelnr.: 69699151

Inhaltsangabe

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.