Inbal Talgam-Cohen

activity

20102026

most citedVertex Sparsifiers: New Results from Old Techniques

24 citations · 57 across the 43 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

cs.GT2010★ 1 cited

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium

Uriel Feige, Inbal Talgam-Cohen

We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate…

cs.DS2010★ 24 cited

Vertex Sparsifiers: New Results from Old Techniques

Matthias Englert, Anupam Gupta, Robert Krauthgamer +3

Given a capacitated graph $G = (V, E)$ and a set of terminals $K \subseteq V$ , how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow betwee…