Tree packing and approximating k-cuts

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 26-27

  Joseph, Naor ^a   Rabani, Yuval ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049083345     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Computer Science Dept., Technion, Haifa 32000, Israel 1 Zs. Baranyai. On the factorization of the complete uniform hypergraph, Infinite and Finite Sets, Colloquia Mathematica Societatis Janos Bolyai, 1973.
2. M. M. Deza and M. Lanrent. Geometry of cuts and metrics, Springer-Verlag, Berlin Heidelberg, 1997.
3. R. Diestel. Graph theory, 2nd Edition, Springer-Verlag.
4. Huzur Saran, Vijay V. Vazirani, Finding $k$ Cuts within Twice the Optimal, SIAM Journal on Computing, v.24 n.1, p.101-108, Feb. 1995 [doi〉10.1137/S0097539792251730]