Algorithms and Discrete Applied Mathematics

First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings

Sumit Ganguly, Ramesh Krishnamurti (Herausgeber)

Buch | Softcover

XVI, 300 Seiten

2015 | 2015
Springer International Publishing (Verlag)
978-3-319-14973-8 (ISBN)

Artikel merken

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.

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.

Erscheint lt. Verlag	9.1.2015
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVI, 300 p. 91 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	486 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algebraic combinatorics • Algorithm analysis and problem complexity • approximation algorithms • Combinatorial Algorithms • combinatorial optimization • Computational Complexity • Computational Geometry • data structures • design and analysis of algorithms • design theory • Discrete Geometry • experimental algorithm methodologies • Graph Algorithms • graph theory • Network Optimization • online algorithms • parallel and distributed algorithms • parameterized complexity • probabilistic combinatorics • randomized algorithms
ISBN-10	3-319-14973-3 / 3319149733
ISBN-13	978-3-319-14973-8 / 9783319149738
Zustand	Neuware