The Resource Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)
Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)
Resource Information
The item Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
 Summary
 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
 Language
 eng
 Extent
 1 online resource (xv, 297 pages)
 Note
 Includes author index
 Contents

 Obstruction Characterizations in Graphs and Digraphs
 Approximation Algorithms
 A PTAS for the Metric Case of the Minimum SumRequirement Communication Spanning Tree Problem
 Constant Approximation for Broadcasting in kcycle 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 Nonsparse Parameter
 Graph Theory. New Polynomial Case for Efficient Domination in P 6free Graphs
 HigherOrder TriangularDistance Delaunay Graphs: GraphTheoretical Properties
 Separator Theorems for Interval Graphs and Proper Interval Graphs
 Bounds for the bChromatic 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 CocktailParty 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
 Bidirectional 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
 Isbn
 9783319149745
 Label
 Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings
 Title
 Algorithms and discrete applied mathematics
 Title remainder
 first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings
 Statement of responsibility
 Sumit Ganguly, Ramesh Krishnamurti (eds.)
 Language
 eng
 Summary
 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
 Cataloging source
 NLGGC
 Dewey number
 004.01/51
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.M35
 LC item number
 C35 2015eb
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2015
 http://bibfra.me/vocab/lite/meetingName
 CALDAM (Conference)
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Ganguly, Sumit
 Krishnamurti, Ramesh
 Series statement

 Lecture Notes in Computer Science,
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 8959
 http://library.link/vocab/subjectName

 Computer science
 Algorithms
 Label
 Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)
 Note
 Includes author index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Obstruction Characterizations in Graphs and Digraphs  Approximation Algorithms  A PTAS for the Metric Case of the Minimum SumRequirement Communication Spanning Tree Problem  Constant Approximation for Broadcasting in kcycle 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 Nonsparse Parameter  Graph Theory. New Polynomial Case for Efficient Domination in P 6free Graphs  HigherOrder TriangularDistance Delaunay Graphs: GraphTheoretical Properties  Separator Theorems for Interval Graphs and Proper Interval Graphs  Bounds for the bChromatic 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 CocktailParty 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  Bidirectional 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
 Control code
 SPR902725841
 Extent
 1 online resource (xv, 297 pages)
 Form of item
 online
 Isbn
 9783319149745
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783319149745
 Other physical details
 illustrations.
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
 Label
 Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)
 Note
 Includes author index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Obstruction Characterizations in Graphs and Digraphs  Approximation Algorithms  A PTAS for the Metric Case of the Minimum SumRequirement Communication Spanning Tree Problem  Constant Approximation for Broadcasting in kcycle 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 Nonsparse Parameter  Graph Theory. New Polynomial Case for Efficient Domination in P 6free Graphs  HigherOrder TriangularDistance Delaunay Graphs: GraphTheoretical Properties  Separator Theorems for Interval Graphs and Proper Interval Graphs  Bounds for the bChromatic 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 CocktailParty 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  Bidirectional 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
 Control code
 SPR902725841
 Extent
 1 online resource (xv, 297 pages)
 Form of item
 online
 Isbn
 9783319149745
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783319149745
 Other physical details
 illustrations.
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics/GR6pryMIc2U/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics/GR6pryMIc2U/">Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics/GR6pryMIc2U/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics/GR6pryMIc2U/">Algorithms and discrete applied mathematics : first international conference, CALDAM 2015, Kanpur, India, February 810, 2015. Proceedings, Sumit Ganguly, Ramesh Krishnamurti (eds.), (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>