Publisher Summary This chapter discusses several applications of the following network
optimization problems: shortest paths, maximum flows, minimum cost flows, assignment and …

Over the past five years a new approach to privacy-preserving data analysis has born fruit
[13, 18, 7, 19, 5, 37, 35, 8, 32]. This approach differs from much (but not all!) of the related …

We study the problem of privacy-preserving access to a database. Particularly, we consider
the problem of privacy-preserving keyword search (KS), where records in the database are …

We motivate and review the definition of differential privacy, survey some results on
differentially private statistical estimators, and outline a research agenda. This survey is …

We initiate a theoretical study of the census problem. Informally, in a census individual
respondents give private information to a trusted party (the census bureau), who publishes a …

A very simple algorithm for the classical problem of computing the maximum network flow
value between every pair of nodes in an undirected, capacitated n node graph is presented; …

In a variety of combinatorial and statistical applications, one needs to know the number of
rectangular arrays of nonnegative integers with given row and column sums. The …

We study the computational complexity of various inverse problems in discrete tomography.
These questions are motivated by demands from the material sciences for the reconstruction …

Let G=(V, E) be an undirected, unweighted graph with n nodes, m edges and edge
connectivity λ. Given an input parameter δ, the edge augmentation problem is to find the …

Suppose there is a three-dimensional table of cross-tabulated nonnegative integer statistics,
and suppose that all of the row, column, and “file” sums are revealed together with the …