Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
February 1, 1998SIAM Journal on Computing

An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

View Full Paper
Ask AI
Bookmark
Share

Authors

YAYonatan AumannBar-Ilan UniversityYRYuval RabaniHebrew University of Jerusalem

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Aumann et al. (1998) studied this question.

synapsesocial.com/papers/6a0fdd8692676d5461fd2cebhttps://doi.org/10.1137/s0097539794285983
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Excluded minors, network decomposition, and multicommodity flow1993 · 227 citations
  2. 2Approximate max-flow min-(multi)cut theorems and their applications1993 · 80 citations