More than 400 books, articles, dissertations, and working papers are included in this
bibliography on cutting and packing problems. The list of published articles and …

We review the recent progress in the design of efficient algorithms for various problems in
geometric optimization. We present several techniques used to attack these problems, such …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

When monitoring spatial phenomena, which can often be modeled as Gaussian processes
(GPs), choosing sensor locations is a fundamental task. There are several common …

Motivated by applications such as document and image classification in information
retrieval, we consider the problem of clustering dynamic point sets in a metric space. We …

We give a deterministic polynomial time method for finding a set cover in a set system (X, ℜ)
of VC-dimension d such that the size of our cover is at most a factor of O (d log (dc)) from the …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

As the field of communications networks continues to evolve, the challenging area of
wireless sensor networks is rapidly coming of age. Recent advances have made it possible …

In this paper, we propose a reinforcement learning approach of collision avoidance and
investigate optimal trajectory planning for unmanned aerial vehicle (UAV) communication …

When monitoring spatial phenomena, which are often modeled as Gaussian Processes
(GPs), choosing sensor locations is a fundamental task. A common strategy is to place …