000 04761nam a22006135i 4500
001 978-3-319-53007-9
003 DE-He213
005 20240730192141.0
007 cr nn 008mamaa
008 170202s2017 sz | s |||| 0|eng d
020 _a9783319530079
_9978-3-319-53007-9
024 7 _a10.1007/978-3-319-53007-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aAlgorithms and Discrete Applied Mathematics
_h[electronic resource] :
_bThird International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings /
_cedited by Daya Gaur, N.S. Narayanaswamy.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIX, 372 p. 72 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10156
505 0 _aOptimal 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.
520 _aThis 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. .
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aComputer graphics.
_94088
650 1 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aComputer Graphics.
_94088
700 1 _aGaur, Daya.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148770
700 1 _aNarayanaswamy, N.S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148771
710 2 _aSpringerLink (Online service)
_9148772
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319530062
776 0 8 _iPrinted edition:
_z9783319530086
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10156
_9148773
856 4 0 _uhttps://doi.org/10.1007/978-3-319-53007-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94096
_d94096