Concentration inequalities for nonlinear matroid intersection

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. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 541-571, 2015

[1]  Jon Lee,et al.  Parametric nonlinear discrete optimization over well-described sets and matroid intersections , 2010, Math. Program..

[2]  Aravind Srinivasan,et al.  A unified approach to scheduling on unrelated parallel machines , 2009, JACM.

[3]  Jan Vondrák,et al.  Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.

[4]  M. Habib Probabilistic methods for algorithmic discrete mathematics , 1998 .

[5]  A. Assad,et al.  The quadratic minimum spanning tree problem , 1992 .

[6]  Van H. Vu On the concentration of multivariate polynomials with small expectation , 1999, Random Struct. Algorithms.

[7]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[8]  Roberto Cordone,et al.  Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem , 2008, CTW.

[9]  Jon Lee,et al.  Approximate Nonlinear Optimization over Weighted Independence Systems , 2009, SIAM J. Discret. Math..

[10]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[11]  Van H. Vu,et al.  Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..

[12]  C. McDiarmid Concentration , 1862, The Dental register.

[13]  S. Boucheron,et al.  Moment inequalities for functions of independent random variables , 2005, math/0503651.

[14]  Shmuel Onn,et al.  Nonlinear bipartite matching , 2008, Discret. Optim..

[15]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[17]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[19]  Devdatt P. Dubhashi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms: Contents , 2009 .

[20]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

[21]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[22]  Gábor Lugosi,et al.  Concentration Inequalities , 2008, COLT.

[23]  Yossi Azar,et al.  Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.

[24]  Mitsuo Gen,et al.  An effective genetic algorithm approach to the quadratic minimum spanning tree problem , 1998, Comput. Oper. Res..

[25]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[26]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[27]  P. P. Chakrabarti,et al.  Improved Quality of Solutions for Multiobjective Spanning Tree Problem Using Distributed Evolutionary Algorithm , 2004, HiPC.

[28]  Vahab S. Mirrokni,et al.  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..

[29]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[30]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

[31]  Eva Riccomagno,et al.  Nonlinear Matroid Optimization and Experimental Design , 2007, SIAM J. Discret. Math..

[32]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[33]  Jinwu Gao,et al.  Fuzzy quadratic minimum spanning tree problem , 2005, Appl. Math. Comput..

[34]  Maxim Sviridenko,et al.  Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case , 2011, 1109.5193.

[35]  V. Nagarajan,et al.  MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS UNDER MATROID AND KNAPSACK CONSTRAINTS , 2007 .

[36]  Maxim Sviridenko,et al.  Concentration and moment inequalities for polynomials of independent random variables , 2012, SODA.

[37]  Van H. Vu,et al.  Concentration of non‐Lipschitz functions and applications , 2002, Random Struct. Algorithms.

[38]  Francis Sourd,et al.  A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem , 2008, INFORMS J. Comput..

[39]  Jan Vondrák,et al.  Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[40]  Mark S. Squillante,et al.  Optimal scheduling of multiclass parallel machines , 1999, SODA '99.

[41]  Temel Öncan,et al.  The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm , 2010, Comput. Oper. Res..

[42]  James G. Oxley,et al.  Matroid theory , 1992 .