Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I de Weili Wu

Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I: Lecture Notes in Computer Science, cartea 14461

Editat de Weili Wu, Jianxiong Guo
en Limba Engleză Paperback – 9 dec 2023
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 52163 lei  6-8 săpt.
  Springer Nature Switzerland – 9 dec 2023 52163 lei  6-8 săpt.
  Springer Nature Switzerland – 9 dec 2023 57771 lei  3-5 săpt.

Din seria Lecture Notes in Computer Science

Preț: 57771 lei

Preț vechi: 72214 lei
-20%

Puncte Express: 867
Preț estimativ în valută:
10226€ • 11921$ • 8859£

Carte disponibilă

Livrare economică 06-20 februarie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031496103
ISBN-10: 3031496108
Pagini: 527
Ilustrații: XVIII, 527 p. 127 illus., 67 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.76 kg
Ediția:1st ed. 2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.