Amol Ghoting, Konstantin Makarychev
SIGMOD/PODS 2009
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and scheduling with time windows and nonlinear objectives. We also show applications related to Constraint Satisfaction and dense polynomial optimization.
Amol Ghoting, Konstantin Makarychev
SIGMOD/PODS 2009
Alexander Kesselman, Zvi Lotker, et al.
STOC 2001
Tracy Kimbrel, Malgorzata Steinder, et al.
WEA 2005
Philip C. Church, Andrzej Goscinski, et al.
EMBC 2011