Activity selection games and the minimum-cut problem
暂无分享,去创建一个
[1] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .
[2] H. Donald Ratliff,et al. A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..
[3] Lloyd S. Shapley,et al. On network flow functions , 1961 .
[4] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[5] L. Shapley. Cores of convex games , 1971 .
[6] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[7] D. Sleator. An 0 (nm log n) algorithm for maximum network flow , 1980 .
[8] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[9] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..
[10] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[11] D. J. A. Welsh,et al. A greedy algorithm for solving a certain class of linear programmes , 1973, Math. Program..
[12] H. Donald Ratliff,et al. A cut approach to a class of quadratic integer programming problems , 1980, Networks.
[13] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[14] Eitan Zemel,et al. Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..
[15] N. Z. Shor. Convergence rate of the gradient descent method with dilatation of the space , 1970 .
[16] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[17] M. Balinski. Notes—On a Selection Problem , 1970 .
[18] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[19] Donald M. Topkis,et al. Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..
[20] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[21] H. D. Ratliff,et al. A Cut Approach to the Rectilinear Distance Facility Location Problem , 1978, Oper. Res..
[22] D. M. Topkis. Equilibrium Points in Nonzero-Sum n-Person Submodular Games , 1979 .
[23] Tatsuro Ichiishi,et al. Super-modularity: Applications to convex games and to the greedy algorithm for LP , 1981 .