Approximate multi-matroid intersection via iterative refinement
暂无分享,去创建一个
Chaitanya Swamy | Rico Zenklusen | Neil Olver | André Linhares | Neil Olver | R. Zenklusen | Chaitanya Swamy | André Linhares
[1] Jan Vondrák,et al. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..
[2] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..
[3] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[4] Aaron Roth,et al. Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.
[5] Fabrizio Grandoni,et al. How to Sell Hyperedges: The Hypermatching Assignment Problem , 2013, SODA.
[6] Jan Vondrák,et al. Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.
[7] Marek Cygan,et al. Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[8] Mohit Singh,et al. Degree bounded matroids and submodular flows , 2012, Comb..
[9] Magnús M. Halldórsson,et al. Approximating discrete collections via local improvements , 1995, SODA '95.
[10] Chaitanya Swamy,et al. Approximation algorithms for minimum norm and ordered optimization problems , 2018, STOC.
[11] Mohit Singh,et al. New approaches to multi-objective optimization , 2013, Mathematical Programming.
[12] Vahab S. Mirrokni,et al. Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..
[13] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[14] J. Vondrák,et al. Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .
[15] Nikhil Bansal,et al. Additive Guarantees for Degree-Bounded Directed Network Design , 2009, SIAM J. Comput..
[16] Rico Zenklusen. Matroidal degree-bounded minimum spanning trees , 2012, SODA.
[17] Yuk Hei Chan,et al. On linear and semidefinite programming relaxations for hypergraph matching , 2010, Mathematical Programming.
[18] R. Ravi,et al. Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets , 2010, TALG.
[19] Ron Aharoni,et al. The intersection of a matroid and a simplicial complex , 2006 .
[20] Ojas Parekh,et al. Generalized Hypergraph Matching via Iterated Packing and Local Ratio , 2014, WAOA.
[21] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[22] Chaitanya Swamy,et al. Approximate multi-matroid intersection via iterative refinement , 2020, Math. Program..
[23] Zoltán Füredi,et al. Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..