79 search results - page 6 / 16 » stoc 2006 |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
STOC
2006
ACM
15 years 3 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
100
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...