227 search results - page 1 / 46 » Deterministic Sampling Algorithms for Network Design |
ESA
2008
Springer
13 years 6 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
NETWORKS
2008
13 years 4 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
DKE
2008
13 years 4 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
EUROPAR
1997
Springer
13 years 9 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...