SIAM Journal on Computing

We present an $O(\log^2{k})$-approximation algorithm for the problem of finding a $k$-vertex connected spanning subgraph of minimum cost, where $n$ is the number of vertices in an input graph, and $k$ is a connectivity requirement. Our algorithm is the first ...

In this work we study the problem of bipartite correlation clustering (BCC), a natural bipartite counterpart of the well-studied correlation clustering (CC) problem [N. Bansal, A. Blum, and S. Chawla, Machine Learning, 56 (2004), pp. 89--113], also referred ...

A strong direct product theorem (SDPT) states that solving $n$ instances of a problem requires $\Omega(n)$ times the resources for a single instance, even to achieve success probability $2^{-\epsilon n}$ for a small enough constant $\epsilon>0.$ We prove that ...

The following buffer management problem arises in network switches providing different levels of services: At the beginning of each time step, one packet can be sent, and afterward an arbitrary number of new packets arrive. Packets that are not sent can be ...

Noninteractive zero-knowledge proofs and noninteractive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this ...

This section of SIAM Journal on Computing contains extended versions of selected papers from the 43rd ACM Symposium on Theory of Computing (STOC), held June 6--8, 2011, in San Jose, California, as part of the fifth Federated Computing Research Conference (...

We study the verification problem in distributed networks, stated as follows. Let $H$ be a subgraph of a network $G$ where each vertex of $G$ knows which edges incident on it are in $H$. We would like to verify whether $H$ has some properties, e.g., if it ...

Consider an optimization problem with $n$ binary variables and $d+1$ linear objective functions. Each valid solution $x \in \{0,1\}^n$ gives rise to an objective vector in $\R^{d+1}$, and one often wants to enumerate the Pareto optima among them. In the ...

Let $C$ be a depth-3 circuit with $n$ variables, degree $d$, and top-fanin $k$ (called ${\Sigma\Pi\Sigma}(k,d,n)$ circuits) over base field ${\mathbb{F}}$. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests ...

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance problem. As a consequence, we obtain essentially optimal multipass space lower bounds in the data stream model for a number of ...

One of the classic results in scheduling theory is the $2$-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines; i.e., job $j$ requires time $p_{ij}$ if processed on machine $i$. ...