In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

The routing of a fleet of vehicles to service a set of customers is important in the field of
distribution. Vehicle routing problems (VRP) arise in many real-life applications within …

Partitioning a multi-dimensional data set into rectangular partitions subject to certain
constraints is an important problem that arises in many database applications, including …

We consider two-dimensional partitioning of general sparse matrices for parallel sparse
matrix-vector multiply operation. We present three hypergraph-partitioning-based methods …

Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms
presents a rigorous yet accessible treatment of theoretical models of parallel computation …

Combinatorial techniques have become essential tools across the landscape of
computational science, and some of the combinatorial ideas undergirding these tools are …

Geometric partitioning is fast and effective for load-balancing dynamic applications,
particularly those requiring geometric locality of data (particle methods, crash simulations) …

We consider the problem of partitioning an array of n items into p intervals so that the
maximum weight of the intervals is minimized. The currently best known bound for this …

A framework is presented for partitioning of multiblock grids used in data parallel
applications. It includes partitioning strategies found in the literature, as well as new …

Separating codes (or systems) are known from combinatorics, and they enjoy increasing
attention due to applications in digital fingerprinting. Previous applications are found in …