630 search results - page 73 / 126 » Hardness results for approximating the bandwidth |
129
Voted
CCR
2004
15 years 14 days ago
2004
Circuit networks are expensive to build, difficult to operate, fragile, and not easily scalable. Many network operators would like to carry circuit traffic as an overlay on top of...
ASPLOS
2012
ACM
13 years 8 months ago
2012
ACM
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
117
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
112
Voted
PODS
2012
ACM
13 years 3 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
126
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...