Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1994: Automata, Languages and Programming pp 487–498Cite as

Multiway cuts in directed and node weighted graphs

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 820))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, “Proof verification and hardness of approximation problems”, Proceedings of 32nd IEEE Symposium on Foundations of Computer Science (1992), 14–23.

    Google Scholar 

  2. S. Chopra, M. R. Rao, “On the multiway cut polyhedron”, Networks 21 (1991), 51–89.

    Google Scholar 

  3. W. H. Cunningham (1991), “The optimal multiterminal cut problem”, DIMACS Series in Disc. Math. and Theor. Comput. Sci. 5 (1991), pp. 105–120.

    Google Scholar 

  4. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour and M. Yannakakis, “The complexity of multiway cuts”, Proceedings, 24th ACM Symposium on Theory of Computing (1992).

    Google Scholar 

  5. P. L. Erdos and L. A. Szekely, “Algorithms and min-max theorems for certain multiway cuts”, Proceedings Symposium on Integer Programming and Combinatorial Optimization (1992).

    Google Scholar 

  6. L.R. Ford, Jr. and D.R. Fulkerson, “Maximal flow through a network”, Canadian Journal of Mathematics 8 (1956)

    Google Scholar 

  7. N. Garg, V.V.Vazirani and M. Yannakakis, “Approximate max-flow min(multi)cut theorems and their applications”, Proceedings, 25th ACM Symposium on Theory of Computing (1993) 698–707.

    Google Scholar 

  8. N. Garg, V. V. Vazirani and M. Yannakakis, “Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover”, Proceedings, Intl. Coll. Automata, Languages and Programming (1993).

    Google Scholar 

  9. P. Klein, A. Agrawal, R. Ravi, S. Rao: Approximation through multicom-modity flow. 31st Symposium on Foundations of Computer Science, 726–737 (1990).

    Google Scholar 

  10. P.N. Klein, S.A. Plotkin, S. Rao and E. Tardos, “Directed network decomposition with applications to directed multicommodity flows”, Unpublished Manuscript (1993).

    Google Scholar 

  11. F.T. Leighton and S. Rao, “An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms”, Proceedings, 29th Symposium of Foundations of Computer Science (1988) 422–431.

    Google Scholar 

  12. C. H. Papadimitriou and M. Yannakakis, “Optimization, approximation and complexity classes”, Journal of Computer and System Sciences 43 (1991), pp. 425–440.

    Google Scholar 

  13. M. Yannakakis, P.C. Kanellakis, S.C. Cosmadakis, C.H. Papadimitriou, “Cutting and Partitioning a graph after a fixed pattern”, Proceedings, 10th Intl.Coll. on Automata, Languages and Programming (1983) 712–722.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engg., Indian Institute of Technology, Delhi

    Naveen Garg & Vijay V. Vazirani

  2. AT & T Bell Laboratories, 07974, Murray Hill, NJ

    Mihalis Yannakakis

Authors
  1. Naveen Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mihalis Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garg, N., Vazirani, V.V., Yannakakis, M. (1994). Multiway cuts in directed and node weighted graphs. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation