An application of simultaneous approximation in combinatorial optimization
暂无分享,去创建一个
[1] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[2] Leslie E. Trotter,et al. Packing and covering with integral feasible flows in integral supply-demand networks , 1987, Math. Program..
[3] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[4] András Frank,et al. A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] U. ZIMMERMANN,et al. Minimization on submodular flows , 1982, Discret. Appl. Math..
[7] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[8] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[9] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[10] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[11] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.
[12] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .