In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …

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 …

The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

We present approximation algorithms for the metric uncapacitated facility location problem
and the metric k-median problem achieving guarantees of 3 and 6 respectively. The …

We consider the problem of maximizing a non-negative submodular set function f: 2N-> RR+
over a ground set N subject to a variety of packing type constraints including (multiple) …

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

Random projection is a simple geometric technique for reducing the dimensionality of a set
of points in Euclidean space while preserving pairwise distances approximately. The …

We consider the problem of clustering a collection of elements based on pairwise judgments
of similarity and dissimilarity. Bansal et al.(in: Proceedings of 43rd FOCS, 2002, pp. 238 …

We consider the following general correlation-clustering problem [N. Bansal, A. Blum, S.
Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of …