Sciweavers

631 search results - page 15 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
IPCO
2004
142views Optimization» more  IPCO 2004»
15 years 3 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
113
Voted
COCOON
2005
Springer
15 years 7 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
115
Voted
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 11 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
166
Voted
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 4 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
91
Voted
IPL
2008
95views more  IPL 2008»
15 years 1 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman