|
|
|
|
| LEADER |
05545nam a22005655i 4500 |
| 001 |
978-3-030-67899-9 |
| 003 |
DE-He213 |
| 005 |
20210624213223.0 |
| 007 |
cr nn 008mamaa |
| 008 |
210119s2021 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783030678999
|9 978-3-030-67899-9
|
| 024 |
7 |
|
|a 10.1007/978-3-030-67899-9
|2 doi
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 072 |
|
7 |
|a UYAM
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Algorithms and Discrete Applied Mathematics
|h [electronic resource] :
|b 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings /
|c edited by Apurva Mudgal, C. R. Subramanian.
|
| 250 |
|
|
|a 1st ed. 2021.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2021.
|
| 300 |
|
|
|a XVIII, 514 p. 100 illus., 40 illus. in color.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 12601
|
| 505 |
0 |
|
|a Approximation 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 |
|
|
|a This 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 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computer mathematics.
|
| 650 |
1 |
4 |
|a Mathematics of Computing.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I17001
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021
|
| 650 |
2 |
4 |
|a Data Structures and Information Theory.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I15009
|
| 650 |
2 |
4 |
|a Computational Mathematics and Numerical Analysis.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/M1400X
|
| 700 |
1 |
|
|a Mudgal, Apurva.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Subramanian, C. R.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783030678982
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783030679002
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 12601
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-67899-9
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
