23,99 €
inkl. MwSt.

Versandfertig in über 4 Wochen
  • Broschiertes Buch

Enclosing problem is an important area of algorithmic research in computer science community which arise in facility location. Due to some constraints, it is not always possible to meet the demand of each client/customer. This constraint gives the birth of the maximal enclosing problem. This book considers the maximal enclosing problem using one and two axis-parallel unit square(s). Then the k-enclosing problem using an axis-parallel square is considered as an extension of the maximal enclosing problem. This book concludes with some future directions of research.

Produktbeschreibung
Enclosing problem is an important area of algorithmic research in computer science community which arise in facility location. Due to some constraints, it is not always possible to meet the demand of each client/customer. This constraint gives the birth of the maximal enclosing problem. This book considers the maximal enclosing problem using one and two axis-parallel unit square(s). Then the k-enclosing problem using an axis-parallel square is considered as an extension of the maximal enclosing problem. This book concludes with some future directions of research.
Autorenporträt
Priya Ranjan Sinha Mahapatra has completed M.Sc. in Applied Mathematics and Master in Computer Application (MCA) in 1997, 2000 respectively. He has completed PhD work in Computational Geometry in 2011. Dr. Mahapatra is currently working as an Assistant professor in Computer Science and Engineering of University of Kalyani, India.