151
click to vote
STOC
16 years 10 days ago
2007 ACM 
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
123
click to vote
STOC
16 years 10 days ago
2007 ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
STOC
16 years 10 days ago
2007 ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
116
click to vote
STOC
16 years 10 days ago
2007 ACM 
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...
82
Voted
STOC
16 years 10 days ago
2007 ACM |
Algorithms