Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings de Paola Flocchini

Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12757

Editat de Paola Flocchini, Lucia Moura
en Limba Engleză Paperback – 30 iun 2021
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 58075 lei

Preț vechi: 72594 lei
-20%

Puncte Express: 871
Preț estimativ în valută:
10267€ • 12241$ • 8905£

Carte tipărită la comandă

Livrare economică 17-31 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030799861
ISBN-10: 3030799867
Pagini: 588
Ilustrații: XX, 588 p. 134 illus., 59 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.84 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Invited Papers.- Relaxed and Approximate Graph Realizations.- Search for combinatorial objects using lattice algorithms – revisited.- Contributed Papers.- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs.- Combinatorics and algorithms for quasi-chain graphs.- Composed Degree-Distance Realizations of Graphs.- All Subgraphs of a Wheel are 5-Coupled-Choosable.- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.- Edge exploration of temporal graphs.- Optimal monomial quadratization for ODE systems.- A Hamilton Cycle in the k-Sided Pancake Network.- Algorithms and Complexity of s-Club Cluster Vertex Deletion.- Covering Convex Polygons by Two Congruent Disks.- The Tandem Duplication Distance Problem is hard over bounded alphabets.- On the oriented coloring of the disjoint union of graphs.- The Pony Express Communication Problem.- Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups.- Vertex Cover at Distance on H-free Graphs.- On an Ordering Problem in Weighted Hypergraphs.- An Efficient Noisy Binary Search in Graphs via Median Approximation.- A study on the existence of null labelling for 3-hypergraphs.- Piercing All Translates of a Set of Axis-Parallel Rectangles.- A triangle process on regular graphs.- Complexity and Algorithms for MUL-Tree Pruning.- Makespan Trade-offs for Visiting Triangle Edges.- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k.- Approximation algorithms for hitting subgraphs.- Isomorphic unordered labeled trees up to substitution ciphering.- Intersecting Disks using Two Congruent Disks.- Disjoint Paths and Connected Subgraphs for H-Free Graphs.- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property.- Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters.- Non-preemptive tree packing.- Card-based Cryptographic Protocols for Three-input Functions Using Private Operations.- Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.- Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs.- New Approximations and Hardness Results for Submodular Partitioning Problems.- An FPT Algorithm for Matching Cut and d-Cut.- Backtrack search for parallelisms of projective spaces.- Approximating Multistage Matching Problems.- Heuristically enhanced IPO Algorithms for Covering Array Generation.