國立虎尾科技大學 |

Algorithms and Discrete Applied Mathematics = First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Algorithms and Discrete Applied Mathematics/ edited by Sumit Ganguly, Ramesh Krishnamurti.
Reminder of title:	First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /
other author:	Ganguly, Sumit.
Description:	XVI, 300 p. 91 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-14974-5
ISBN:	9783319149745

Algorithms and Discrete Applied Mathematics = First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /
Algorithms and Discrete Applied MathematicsFirst International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /[electronic resource] :edited by Sumit Ganguly, Ramesh Krishnamurti. - 1st ed. 2015. - XVI, 300 p. 91 illus.online resource. - Theoretical Computer Science and General Issues ;8959. - Theoretical Computer Science and General Issues ;9163.

Obstruction 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.

This 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.

ISBN: 9783319149745

Standard No.: 10.1007/978-3-319-14974-5doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Discrete Applied Mathematics = First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings /
LDR:03848nam a22004095i 4500 001 963509
003 DE-He213
005 20200630012742.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319149745 $9 978-3-319-14974-5
024 7 $a 10.1007/978-3-319-14974-5 $2 doi
035 $a 978-3-319-14974-5
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Algorithms and Discrete Applied Mathematics $h [electronic resource] : $b First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings / $c edited by Sumit Ganguly, Ramesh Krishnamurti.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XVI, 300 p. 91 illus. $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 8959
505 0 $a Obstruction 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.
520 $a This 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.
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer graphics. $3 561602
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Ganguly, Sumit. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 649986
700 1 $a Krishnamurti, Ramesh. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1065672
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319149752
776 0 8 $i Printed edition: $z 9783319149738
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-14974-5
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)