STOC
2005
ACM
14 years 5 months ago
2005
ACM
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...