3874 search results - page 167 / 775 » Approximation Algorithms for k-hurdle Problems |
112
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
131
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
167
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
138
click to vote
ESA
1999
Springer
15 years 6 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
121
Voted
COCO
2007
Springer
15 years 5 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...