Approximating submodular functions everywhere
暂无分享,去创建一个
Vahab S. Mirrokni | Satoru Iwata | Michel X. Goemans | Nicholas J. A. Harvey | V. Mirrokni | M. Goemans | S. Iwata
[1] K. Fan. On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I. , 1949, Proceedings of the National Academy of Sciences of the United States of America.
[2] K. Fan. On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations: II. , 1949, Proceedings of the National Academy of Sciences of the United States of America.
[3] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[4] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[5] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[6] M. Todd,et al. The Ellipsoid Method: A Survey , 1980 .
[7] Laurence A. Wolsey,et al. An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..
[8] Michael J. Todd. On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid , 1982, Math. Oper. Res..
[9] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[10] J. Spencer. Six standard deviations suffice , 1985 .
[11] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[12] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[13] 藤重 悟. Submodular functions and optimization , 1991 .
[14] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[15] A. Assad,et al. The quadratic minimum spanning tree problem , 1992 .
[16] Leonid Khachiyan,et al. Rounding of Polytopes in the Real Number Model of Computation , 1996, Math. Oper. Res..
[17] H. Narayanan. Submodular functions and electrical networks , 1997 .
[18] K. Ball. An Elementary Introduction to Modern Convex Geometry , 1997 .
[19] Kazuo Murota,et al. Discrete convex analysis , 1998, Math. Program..
[20] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[21] Satoru Iwata,et al. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.
[22] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[23] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[24] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[25] Satoru Iwata,et al. A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.
[26] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[27] Peng Sun,et al. Computation of Minimum Volume Covering Ellipsoids , 2002, Oper. Res..
[28] D. Golovin. Max-min fair allocation of indivisible goods , 2005 .
[29] Aranyak Mehta,et al. Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions , 2005, Algorithmica.
[30] Piyush Kumar,et al. Minimum-Volume Enclosing Ellipsoids and Core Sets , 2005 .
[31] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[32] Shahar Dobzinski,et al. An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.
[33] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[34] Osman Guler,et al. The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases , 2007, 0709.0707.
[35] Subhash Khot,et al. Approximation Algorithms for the Max-Min Allocation Problem , 2007, APPROX-RANDOM.
[36] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[37] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[38] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[39] J. Bilmes,et al. Notes on Graph Cuts with Submodular Edge Weights , 2009, NIPS 2009.
[40] Satoru Iwata,et al. A simple combinatorial algorithm for submodular function minimization , 2009, SODA.
[41] J. Alonso,et al. Convex and Discrete Geometry , 2009 .
[42] Gagan Goel,et al. Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[43] Satoru Iwata,et al. Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[44] J. Bilmes,et al. Cooperative Cuts: Graph Cuts with Submodular Edge Weights , 2010 .
[45] Maria-Florina Balcan,et al. Learning submodular functions , 2010, STOC '11.