Given a nonnegative matrix $ A $, can you find diagonal matrices $ D_1,~ D_2 $ such that $
D_1AD_2 $ is doubly stochastic? The answer to this question is known as Sinkhorn's …

When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …

Numerous graph mining applications rely on detecting subgraphs which are large near-
cliques. Since formulations that are geared towards finding large near-cliques are hard and …

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

We consider the problem of finding the minimum capacity cut in a directed network G with n
nodes. This problem has applications to network reliability and survivability and is useful in …

Densest subgraph discovery (DSD) is a fundamental problem in graph mining. It has been
studied for decades, and is widely used in various areas, including network science …

This paper provides a review of recent results on scheduling with controllable processing
times. The stress is on the methodological aspects that include parametric flow techniques …

Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …

Clustering remains a vibrant area of research in statistics. Although there are many books on
this topic, there are relatively few that are well founded in the theoretical aspects. In Robust …

Social network data is widely shared, transferred and published for research purposes and
business interests, but it has raised much concern on users' privacy. Even though users' …