Atjaunināt sīkdatņu piekrišanu

Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings 2015 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 300 pages, height x width: 235x155 mm, weight: 4803 g, 91 Illustrations, black and white; XVI, 300 p. 91 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8959
  • Izdošanas datums: 09-Jan-2015
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319149733
  • ISBN-13: 9783319149738
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 300 pages, height x width: 235x155 mm, weight: 4803 g, 91 Illustrations, black and white; XVI, 300 p. 91 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8959
  • Izdošanas datums: 09-Jan-2015
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319149733
  • ISBN-13: 9783319149738
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.
Probabilistic Arguments in Graph Coloring (Invited Talk)
1(8)
C.R. Subramanian
Approximation Algorithms
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
9(12)
Santiago V. Ravelo
Carlos E. Ferreira
Constant Approximation for Broadcasting in k-cycle Graph
21(12)
Puspal Bhabak
Hovhannes A. Harutyunyan
Computational Geometry
Three Paths to Point Placement
33(12)
Md. Shafiul Alam
Asish Mukhopadhyay
Vertex Guarding in Weak Visibility Polygons
45(13)
Pritam Bhattacharya
Subir Kumar Ghosh
Bodhayan Roy
On Collections of Polygons Cuttable with a Segment Saw
58(11)
Adrian Dumitrescu
Anirban Ghosh
Masud Hasan
Rectilinear Path Problems in Restricted Memory Setup
69(12)
Binay K. Bhattacharya
Minati De
Anil Maheshwari
Subhas C. Nandy
Sasanka Roy
Graph Theory
New Polynomial Case for Efficient Domination in P6-free Graphs
81(8)
T. Karthick
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
89(12)
Ahmad Biniaz
Anil Maheshwari
Michiel Smid
Separator Theorems for Interval Graphs and Proper Interval Graphs
101(10)
B.S. Panda
Bounds for the b-chromatic Number of Induced Subgraphs and G -- e
111(6)
P. Francis
S. Francis Raj
New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
117(9)
Ashok Kumar Das
Ritapa Chakraborty
On Spectra of Corona Graphs
126(12)
Rohan Sharma
Bibhas Adhikari
Abhishek Mishra
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
138(12)
Manoj Changat
Divya Sindhu Lekha
Henry Martyn Mulder
Ajitha R. Subhamathi
Tree Path Labeling of Hypergraphs -- A Generalization of the Consecutive Ones Property
150(7)
N.S. Narayanaswamy
Anju Srinivasan
On a Special Class of Boxicity 2 Graphs
157(12)
Sujoy Kumar Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
Domination in Some Subclasses of Bipartite Graphs
169(12)
Arti Pandey
B.S. Panda
Computational Complexity
Parameterized Analogues of Probabilistic Computation
181(12)
Ankit Chauhan
B. V. Raghavendra Rao
Algebraic Expressions of Rhomboidal Graphs
193(12)
Mark Korenblit
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
205(12)
Sigve Hortemo Sother
Algorithms
Associativity for Binary Parallel Processes: A Quantitative Study
217(12)
Olivier Bodini
Antoine Genitrini
Frederic Peschanski
Nicolas Rolin
A Tight Bound for Congestion of an Embedding
229(9)
Baul Manuel
Indra Rajasingh
R. Sundara Rajan
N. Parthiban
T.M. Rajalaxmi
Auction/Belief Propagation Algorithms for Constrained Assignment Problem
238(12)
Mindi Yuan
Wei Shen
Jun Li
Yannis Pavlidis
Shen Li
Bi-directional Search for Skyline Probability
250(12)
Aran K. Pujari
Venkateswara Rao Kagita
Anubhuti Garg
Vineet Padmanabhan
Cumulative Vehicle Routing Problem: A Column Generation Approach
262(13)
Daya Ram Gaur
Rishi Ranjan Singh
Energy Efficient Sweep Coverage with Mobile and Static Sensors
275(11)
Barun Gorain
Partha Sarathi Mandal
Generation of Random Digital Curves Using Combinatorial Techniques
286(13)
Apurba Sarkar
Arindam Biswas
Mousumi Dutt
Arnab Bhattacharya
Author Index 299