Affiliation:
1. The University of Tokyo
Publisher
The Operations Research Society of Japan
Subject
Management Science and Operations Research,General Decision Sciences
Reference6 articles.
1. [1] J. Edmonds: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, 69B (1965), 125–130.
2. [2] H. Hirai and G. Pap: Tree metrics and edge-disjoint S-paths. Mathematical Programming, Series A, 147 (2014), 81–123.
3. [3] C.A.J. Hurkens, L. Lovász, A. Schrijver and É. Tardos: How to tidy up your set-system? In A. Hajnal. L. Lovász, and V.T.Sós (eds.): Combinatorics (Proceedings Seventh Hungarian Colloquium on Combinatorics, Eger, 1987) (North-Holland, Amsterdam, 1988), 309–314.
4. [4] K. Jain: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21 (2001), 39–60.
5. [5] A.V. Karzanov: How to tidy up a symmetric set-system by use of uncrossing operations. Theoretical Computer Science, 157 (1996), 215–225.