Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 2000SIAM Journal on Discrete Mathematics

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

View Full Paper
Ask AI
Bookmark
Share

Authors

LFLisa FleischerMedizinische Hochschule Hannover

Discussion

Loading...

Member takes

Implication

Key Points

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

Cite This Study

Lisa Fleischer (2000) studied this question.

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

Also Consider

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

  1. 1Fast Approximation Algorithms for Fractional Packing and Covering Problems1995 · 554 citations
  2. 2The maximum concurrent flow problem1990 · 440 citations
  3. 3Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications1996 · 337 citations
  4. 4An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm1998 · 264 citations
  5. 5Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints1994 · 140 citations