628 search results - page 41 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
131
Voted
IPPS
2010
IEEE
15 years 16 days ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
139
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
138
click to vote
DAC
1989
ACM
15 years 6 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
123
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
155
Voted
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...