126
Voted
FOCS
15 years 7 months ago
2008 IEEE 
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
131
Voted
FOCS
15 years 7 months ago
2008 IEEE 
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
FOCS
15 years 7 months ago
2008 IEEE 
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
FOCS
15 years 7 months ago
2008 IEEE 
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
FOCS
15 years 7 months ago
2008 IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
|
Theoretical Computer Science