000 | 05411nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-030-67899-9 | ||
003 | DE-He213 | ||
005 | 20240730175403.0 | ||
007 | cr nn 008mamaa | ||
008 | 210119s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030678999 _9978-3-030-67899-9 |
||
024 | 7 |
_a10.1007/978-3-030-67899-9 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAlgorithms and Discrete Applied Mathematics _h[electronic resource] : _b7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings / _cedited by Apurva Mudgal, C. R. Subramanian. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXVIII, 514 p. 100 illus., 40 illus. in color. _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 ; _v12601 |
|
505 | 0 | _aApproximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . | |
520 | _aThis book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers presented in this volume were carefully reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity. . | ||
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 0 |
_aMathematics _xData processing. _919904 |
|
650 | 1 | 4 |
_aMathematics of Computing. _931875 |
650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
650 | 2 | 4 |
_aComputational Mathematics and Numerical Analysis. _931598 |
700 | 1 |
_aMudgal, Apurva. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9116613 |
|
700 | 1 |
_aSubramanian, C. R. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9116614 |
|
710 | 2 |
_aSpringerLink (Online service) _9116615 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030678982 |
776 | 0 | 8 |
_iPrinted edition: _z9783030679002 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12601 _9116616 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-67899-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c89914 _d89914 |