大葉大學圖書館 |

Algorithms and discrete applied mathematics[electronic resource] :first International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	004.0151
書名/作者:	Algorithms and discrete applied mathematics : first International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015 : proceedings // edited by Sumit Ganguly, Ramesh Krishnamurti.
其他作者:	Ganguly, Sumit.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xvi, 300 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer science - Periodicals. - Mathematics
標題:	Algorithms
標題:	Computer Science.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Data Structures.
標題:	Discrete Mathematics in Computer Science.
標題:	Numeric Computing.
標題:	Computer Graphics.
標題:	Algorithms.
ISBN:	9783319149745 (electronic bk.)
ISBN:	9783319149738 (paper)
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-14974-5

Algorithms and discrete applied mathematics[electronic resource] :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. - Cham :Springer International Publishing :2015. - xvi, 300 p. :ill., digital ;24 cm. - Lecture notes in computer science,89590302-9743 ;. - Lecture notes in computer science ;7103..

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 (electronic bk.)

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

345167
Computer science
--Mathematics--Periodicals.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithms and discrete applied mathematics[electronic resource] :first International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015 : proceedings /
LDR:03476nam a2200325 a 4500 001 426263
003 DE-He213
005 20150826100055.0
006 m d
007 cr nn 008maaau
008 151119s2015 gw s 0 eng d
020 $a 9783319149745 (electronic bk.)
020 $a 9783319149738 (paper)
024 7 $a 10.1007/978-3-319-14974-5 $2 doi
035 $a 978-3-319-14974-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b C145 2015
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xvi, 300 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 Computer science $x Mathematics $v Periodicals. $3 345167
650 0 $a Algorithms $3 135237
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Data Structures. $3 467911
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Numeric Computing. $3 466954
650 2 4 $a Computer Graphics. $3 464677
650 2 4 $a Algorithms. $3 182797
700 1 $a Ganguly, Sumit. $3 606081
700 1 $a Krishnamurti, Ramesh. $3 606082
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-14974-5
950 $a Computer Science (Springer-11645)