LEADER 05493nam 22008415 450 001 996198833003316 005 20230329113114.0 010 $a3-319-14974-1 024 7 $a10.1007/978-3-319-14974-5 035 $a(CKB)2560000000326189 035 $a(Springer)9783319149745 035 $a(MH)014293525-5 035 $a(SSID)ssj0001424406 035 $a(PQKBManifestationID)11891207 035 $a(PQKBTitleCode)TC0001424406 035 $a(PQKBWorkID)11363886 035 $a(PQKB)10279999 035 $a(DE-He213)978-3-319-14974-5 035 $a(MiAaPQ)EBC6302510 035 $a(MiAaPQ)EBC5587739 035 $a(Au-PeEL)EBL5587739 035 $a(OCoLC)902725841 035 $a(PPN)183520025 035 $a(EXLCZ)992560000000326189 100 $a20150128d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics$b[electronic resource] $eFirst International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /$fedited by Sumit Ganguly, Ramesh Krishnamurti 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XVI, 300 p. 91 illus.)$conline resource 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8959 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-14973-3 327 $aObstruction Characterizations in Graphs and Digraphs -- Approximation Algorithms -- A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem -- Constant Approximation for Broadcasting in k-cycle Graph -- Computational Geometry -- Three paths to point placement -- Vertex Guarding in Weak Visibility Polygons -- On Collections of Polygons Cuttable with a Segment Saw -- Rectilinear path problems in the presences of rectangular obstacles -- Computational Complexity -- Parameterized Analogues of Probabilistic Computation -- Algebraic Expressions of Rhomboidal Graphs -- Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter -- Graph Theory. New Polynomial Case for Efficient Domination in P 6-free Graphs -- Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties -- Separator Theorems for Interval Graphs and Proper Interval Graphs -- Bounds for the b-Chromatic Number of Induced Subgraphs and G e -- New Characterizations Of Proper Interval Bigraphs and Proper Circular Arc Bigraphs -- On Spectra of Corona Graphs -- Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs -- Tree Path Labeling of Hypergraphs A Generalization of the Consecutive Ones Property -- On a special class of boxicity 2 graph -- Algorithms -- Associativity for Binary Parallel Processes: a Quantitative Study -- A Tight Bound for Congestion of an Embedding.-Auction/Belief propagation algorithms for constrained assignment problem -- Domination in some subclasses of bipartite graphs -- Bi-directional Search for Skyline Probability -- Cumulative vehicle routing problem: a column generation approach -- Energy Efficient Sweep Coverage with Mobile and Static Sensors -- Generation of Random Digital Curves using Combinatorial Techniques. 330 $aThis book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference.The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8959 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 676 $a005.3 702 $aGanguly$b Sumit$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKrishnamurti$b Ramesh$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198833003316 996 $aAlgorithms and Discrete Applied Mathematics$92587952 997 $aUNISA 999 $aThis Record contains information from the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others the Library of Congress