1993•Unpublished venueRequires access

Approximate max-flow min-(multi)cut theorems and their applications

Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis

Abstract

Article Approximate max-flow min-(multi)cut theorems and their applications Share on Authors: Naveen Garg View Profile , Vijay V. Vazirani View Profile , Mihalis Yannakakis View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 698–707https://doi.org/10.1145/167088.167266Online:01 June 1993Publication History 60citation1,484DownloadsMetricsTotal Citations60Total Downloads1,484Last 12 Months30Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

About this research paper

What this paper is about

Why it matters

OpenAlex reports 81 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Citation, Computer science, Flow (mathematics), Discrete mathematics, Theoretical computer science, Mathematics, World Wide Web, Geometry