Difference between revisions of "CATS-Oct-24-2014"
(Created page with "== Title == Parallel Algorithms for Geometric Graph Problems == Speaker == [http://grigory.us Grigory Yaroslavtsev] == Abstract == I will describe algorithms for geometric g...") |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Title == | == Title == | ||
| − | + | An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization | |
== Speaker == | == Speaker == | ||
| − | + | Thomas Pensyl | |
== Abstract == | == Abstract == | ||
| − | |||
| − | + | Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to negative correlation properties. However, what if an application naturally calls for dependent rounding on the one hand, and desires positive correlation on the other? More generally, we develop algorithms that guarantee the known properties of dependent rounding, but also have nearly best-possible behavior - near-independence, which generalizes positive correlation - on "small" subsets of the variables. The recent breakthrough of Li & Svensson for the classical k-median problem has to handle positive correlation in certain dependent-rounding settings, and does so implicitly. We improve upon Li-Svensson's approximation ratio for k-median from 2.732+ϵ to 2.611+ϵ by developing an algorithm that improves upon various aspects of their work. Our dependent-rounding approach helps us improve the dependence of the runtime on the parameter ϵ from Li-Svensson's N^O(1/ϵ^2) to N^O((1/ϵ)log(1/ϵ)). | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 16:05, 23 October 2014
Title[edit]
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
Speaker[edit]
Thomas Pensyl
Abstract[edit]
Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to negative correlation properties. However, what if an application naturally calls for dependent rounding on the one hand, and desires positive correlation on the other? More generally, we develop algorithms that guarantee the known properties of dependent rounding, but also have nearly best-possible behavior - near-independence, which generalizes positive correlation - on "small" subsets of the variables. The recent breakthrough of Li & Svensson for the classical k-median problem has to handle positive correlation in certain dependent-rounding settings, and does so implicitly. We improve upon Li-Svensson's approximation ratio for k-median from 2.732+ϵ to 2.611+ϵ by developing an algorithm that improves upon various aspects of their work. Our dependent-rounding approach helps us improve the dependence of the runtime on the parameter ϵ from Li-Svensson's N^O(1/ϵ^2) to N^O((1/ϵ)log(1/ϵ)).
