On the public citation graph

Improved bounds on the max-flow min-cut ratio for multicommodity flows

https://doi.org/10.1007/bf01299746
0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-59408-6_38openalex-snapshot
Approximating minimum feedback sets and multi-cuts in directed graphs
inferredcites →https://doi.org/10.1007/bf01200755openalex-snapshot
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
inferredcites →https://doi.org/10.1007/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/bf01305312openalex-snapshot
Improved Approximations for the Minimum-Cut Ratio and the Flux
inferredcites →https://doi.org/10.1016/s0095-8956(81)80012-3openalex-snapshot
Multicommodity flows in planar graphs
inferredcites →https://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferredcites →https://doi.org/10.1109/sfcs.1988.21958openalex-snapshot
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
inferredcites →https://doi.org/10.1145/103418.103425openalex-snapshot
Fast approximation algorithms for multicommodity flow problems
inferredcites →https://doi.org/10.1145/167088.167263openalex-snapshot
Improved bounds on the max-flow min-cut ratio for multicommodity flows
inferredcites →https://doi.org/10.1145/167088.167266openalex-snapshot
Approximate max-flow min-(multi)cut theorems and their applications
inferredcites →https://doi.org/10.1145/195058.195238openalex-snapshot
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1996.0833openalex-snapshot
Approximation Algorithms for Steiner and Directed Multicuts
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_6openalex-snapshot
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
inferred← citeshttps://doi.org/10.1007/bf01200755openalex-snapshot
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
inferred← citeshttps://doi.org/10.1007/s00493-005-0015-5openalex-snapshot
Approximating Directed Multicuts
inferred← citeshttps://doi.org/10.1007/s10107-017-1227-3openalex-snapshot
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
inferred← citeshttps://doi.org/10.1007/s40305-024-00567-8openalex-snapshot
Direct Product Multicommodity Max-Concurrent-Flow Min-Sparse-Cut Theorem
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00053openalex-snapshot
Network Coding Gaps for Completion Times of Multiple Unicasts
inferred← citeshttps://doi.org/10.1137/100787337openalex-snapshot
Vertex Sparsification and Oblivious Reductions
inferred← citeshttps://doi.org/10.1137/130906830openalex-snapshot
Multicommodity Flows and Cuts in Polymatroidal Networks
inferred← citeshttps://doi.org/10.1137/18m1228591openalex-snapshot
Hallucination Helps: Energy Efficient Virtual Circuit Routing
inferred← citeshttps://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferred← citeshttps://doi.org/10.1137/s089548010138917xopenalex-snapshot
A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
inferred← citeshttps://doi.org/10.1145/2090236.2090268openalex-snapshot
Multicommodity flows and cuts in polymatroidal networks
inferred← citeshttps://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferred← citeshttps://doi.org/10.1145/3406325.3451103openalex-snapshot
A quasipolynomial (2 + ε )-approximation for planar sparsest cut
inferred← citeshttps://doi.org/10.1287/ijoc.11.4.370openalex-snapshot
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.