328 search results - page 6 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
DCG
2008
13 years 8 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
ECCC
2006
13 years 8 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...