49 search results - page 10 / 10 » focs 2004 |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have incon...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...