國立虎尾科技大學 |

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.
corporate name:	Workshop on the Preservation of Stability under Discretization
Published:	Cham :Springer International Publishing : : 2015.,
Description:	xvi, 300 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Computer science - Congresses. - Mathematics -
Online resource:	http://dx.doi.org/10.1007/978-3-319-14974-5
ISBN:	9783319149745 (electronic bk.)

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. - Cham :Springer International Publishing :2015. - xvi, 300 p. :ill., digital ;24 cm. - Lecture notes in computer science,89590302-9743 ;. - Lecture notes in computer science ;6140..

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:

528619
Computer science
--Mathematics--Congresses.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithms and discrete applied mathematics = first International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015 : proceedings /
LDR:03476nam a2200325 a 4500 001 835968
003 DE-He213
005 20150826100055.0
006 m d
007 cr nn 008maaau
008 160421s2015 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 Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
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 : $c 2015. $b Springer International Publishing : $b Imprint: Springer,
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 Congresses. $3 528619
650 0 $a Algorithms $v Congresses. $3 527696
650 1 4 $a Computer Science. $3 593922
650 2 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
650 2 4 $a Algorithms. $3 527865
700 1 $a Ganguly, Sumit. $3 649986
700 1 $a Krishnamurti, Ramesh. $3 1065672
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-14974-5
950 $a Computer Science (Springer-11645)