Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics de Daya Gaur

Algorithms and Discrete Applied Mathematics: Lecture Notes in Computer Science, cartea 10156

Editat de Daya Gaur, N. S. Narayanaswamy
en Limba Engleză Paperback – 3 feb 2017
This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017.
The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32688 lei

Preț vechi: 40860 lei
-20%

Puncte Express: 490

Carte tipărită la comandă

Livrare economică 26 mai-09 iunie

 Adaugă în coș

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

Specificații

ISBN-13: 9783319530062
ISBN-10: 3319530062
Pagini: 392
Ilustrații: XIX, 372 p. 72 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Optimal embedding of locally twisted cubes into grids.- Polynomial Time Algorithms for Bichromatic Problems.- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function.- Optimum Gathering of Asynchronous Robots.- Improved bounds for poset sorting in the forbidden-comparison regime.- Positional Dominance: Concepts and Algorithms.- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams.- Querying Relational Event Graphs using Colored Range Searching Data Structures.- Axiomatic Characterization of the Interval Function of a Bipartite Graph.- Analysis of 2-Opt Heuristic for the Winner Determination Problem under the Chamberlin-Courant System.- On Structural Parameterizations of Graph Motif and Chromatic Number.- On chromatic number of colored mixed graphs.- Optimizing movement in a convex path-network to establish connectivity.- On colouring point visibility graphs.- Decomposing semi-complete multigraphs and directed graphs into paths of length two.- On Rank and MDR Cyclic codes of length 2k over Z8.- Group Distance Magic Labeling ofCrn.- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs.- Incremental algorithms to update visibility polygons.- Liar's Domination in 2D.- Structured Instances of Restricted Assignment with Two Processing Times.- Elusiveness of finding degrees.- Maximum weighted independent sets with a budget.- Demand hitting and covering of intervals.- Exact And Parameterized Algorithms For (k; i)-coloring.- The Graph of the Pedigree Polytope is Asymptotically Almost Complete. – Induced matching in some subclasses of bipartite graphs.- Hamiltonicity in Split Graphs - a dichotomy.- Finding Large Independent Sets in Line of Sight Networks.- A lower bound of the cd-chromatic number and its complexity.- Stability number and k-Hamiltonian [a,b]-factors.- Subgraphs with orthogonal [0; ki]n1-factorizations in graphs.