3875 search results - page 201 / 775 » Approximation algorithms for the 0-extension problem |
195
click to vote
TCC
2012
Springer
14 years 1 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
179
click to vote
IPL
2010
15 years 25 days ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
192
click to vote
ESA
1999
Springer
15 years 10 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...
172
click to vote
COCO
2007
Springer
15 years 10 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...
138
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...