Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
暂无分享,去创建一个
[1] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[2] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[3] Jan Vondrák,et al. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2010, Math. Oper. Res..
[4] Satoru Iwata,et al. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.
[5] Martin Skutella,et al. Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.
[6] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[7] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[8] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[9] Oded Schwartz,et al. On the complexity of approximating k-set packing , 2006, computational complexity.
[10] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[11] Vahab S. Mirrokni,et al. Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.
[12] Piotr Berman,et al. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..
[13] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory, Ser. B.
[14] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[15] Jan Vondrák,et al. Submodular maximization by simulated annealing , 2010, SODA '11.
[16] V. Nagarajan,et al. MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS UNDER MATROID AND KNAPSACK CONSTRAINTS , 2007 .
[17] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[18] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[19] F. Lazebnik,et al. A new series of dense graphs of high girth , 1995, math/9501231.
[20] Thomas H. Brylawski. Some properties of basic families of subsets , 1973, Discret. Math..
[21] 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..
[22] G. Nemhauser,et al. On the Uncapacitated Location Problem , 1977 .
[23] Curtis Greene,et al. A multiple exchange property for bases , 1973 .
[24] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[25] Douglas R. Woodall. An exchange theorem for bases of matroids , 1974 .
[26] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[27] Bernhard Korte,et al. K-greedy algorithms for independence systems , 1978, Z. Oper. Research.
[28] Barun Chandra,et al. Greedy local improvement and weighted set packing approximation , 2001, SODA '99.
[29] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[30] Esther M. Arkin,et al. On Local Search for Weighted k-Set Packing , 1997, Math. Oper. Res..
[31] Jan Vondrák,et al. Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[32] James G. Oxley,et al. Matroid theory , 1992 .
[33] T. Magnanti,et al. Some Abstract Pivot Algorithms , 1975 .
[34] B. Korte,et al. Worst case analysis of greedy type algorithms for independence systems , 1980 .
[35] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.