Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
Optimal scheduling of multiclass parallel machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the concentration of multivariate polynomials with small expectation
Random Structures & Algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Nonlinear Matroid Optimization and Experimental Design
SIAM Journal on Discrete Mathematics
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
INFORMS Journal on Computing
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Computers and Operations Research
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Approximate Nonlinear Optimization over Weighted Independence Systems
SIAM Journal on Discrete Mathematics
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Discrete Optimization
| Hi-index | 0.02 |
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base poly-topes. We prove concentration inequalities for polynomial objective functions and constraints that have 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.