On the public citation graph
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
0 signed · 71 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01299746openalex-snapshot
Improved bounds on the max-flow min-cut ratio for multicommodity flows
inferredcites →https://doi.org/10.1007/bf01683259openalex-snapshot
New problems complete for nondeterministic log space
inferredcites →https://doi.org/10.1007/bfb0039624openalex-snapshot
On the contact-minimization-problem
inferredcites →https://doi.org/10.1007/springerreference_5846openalex-snapshot
Multicommodity network flows
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/12.42135openalex-snapshot
The via minimization problem is NP-complete
inferredcites →https://doi.org/10.1109/sfcs.1987.26openalex-snapshot
Finding near optimal separators in planar graphs
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.1109/tcs.1983.1085357openalex-snapshot
A graph-theoretic via minimization algorithm for two-layer printed circuit boards
inferredcites →https://doi.org/10.1109/tit.1956.1056816openalex-snapshot
A note on the maximum flow through a network
inferredcites →https://doi.org/10.1137/0219018openalex-snapshot
A Heuristic Algorithm for Small Separators in Arbitrary Graphs
inferredcites →https://doi.org/10.1137/0402004openalex-snapshot
Graph Bipartization and via minimization
inferredcites →https://doi.org/10.1137/s0097539792241175openalex-snapshot
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
inferredcites →https://doi.org/10.1145/103418.103425openalex-snapshot
Fast approximation algorithms for multicommodity flow problems
inferredcites →https://doi.org/10.1145/129712.129736openalex-snapshot
The complexity of multiway cuts (extended abstract)
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/37888.37912openalex-snapshot
Via minimization for gridless layouts
inferredcites →https://doi.org/10.1145/62212.62233openalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1145/77600.77620openalex-snapshot
The maximum concurrent flow problem
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
inferredcites →https://doi.org/10.5555/2334.2335openalex-snapshot
Optimal layer assignment for interconnect
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/wcm.2199openalex-snapshot
Autonomous aggregation in location aware ad hoc wireless networks
inferred← citeshttps://doi.org/10.1006/jagm.1996.0833openalex-snapshot
Approximation Algorithms for Steiner and Directed Multicuts
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_5openalex-snapshot
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_38openalex-snapshot
Approximating minimum feedback sets and multi-cuts in directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_12openalex-snapshot
Primal-dual approximation algorithms for feedback problems in planar graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_9openalex-snapshot
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in $$\mathsf {FPT}$$ Time
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/978-3-540-24587-2_61openalex-snapshot
Wavelength Conversion in Shortest-Path All-Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_24openalex-snapshot
The Multi-multiway Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_4openalex-snapshot
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
inferred← citeshttps://doi.org/10.1007/978-3-642-30373-9_18openalex-snapshot
Adversary Games in Secure/Reliable Network Routing
inferred← citeshttps://doi.org/10.1007/978-3-662-04565-7_20openalex-snapshot
Multicut in General Graphs
inferred← citeshttps://doi.org/10.1007/bf01299746openalex-snapshot
Improved bounds on the max-flow min-cut ratio for multicommodity flows
inferred← citeshttps://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9171-5openalex-snapshot
Approximation Algorithms for Requirement Cut on Graphs
inferred← citeshttps://doi.org/10.1007/s00493-004-0015-xopenalex-snapshot
Cuts, Trees and ℓ1-Embeddings of Graphs*
inferred← citeshttps://doi.org/10.1007/s00778-021-00705-1openalex-snapshot
RNE: computing shortest paths using road network embedding
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/s10107-023-02044-1openalex-snapshot
A 2-approximation for the bounded treewidth sparsest cut problem in $$\textsf{FPT}$$ Time
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.1007/s43037-024-00373-7openalex-snapshot
Stochastic embeddings of graphs into trees
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.009openalex-snapshot
Approximating the fixed linear crossing number
inferred← citeshttps://doi.org/10.1016/j.orl.2010.02.009openalex-snapshot
An improved approximation algorithm for requirement cut
inferred← citeshttps://doi.org/10.1016/j.physa.2024.129990openalex-snapshot
Max-flow min-cut theorem in quantum computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.026openalex-snapshot
The multi-multiway cut problem
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00073-7openalex-snapshot
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00071-1openalex-snapshot
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133863openalex-snapshot
Stochastic Strategic Routing Reduces Attack Effects
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228230openalex-snapshot
Multi-multiway cuts with edge labels
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00038openalex-snapshot
A Learning-based Method for Computing Shortest Path Distances on Road Networks
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814611openalex-snapshot
Cuts, trees and l/sub 1/-embeddings of graphs
inferred← citeshttps://doi.org/10.1109/wd.2010.5657705openalex-snapshot
Self-organized aggregation in irregular wireless networks
inferred← citeshttps://doi.org/10.1137/100787337openalex-snapshot
Vertex Sparsification and Oblivious Reductions
inferred← citeshttps://doi.org/10.1137/18m1228591openalex-snapshot
Hallucination Helps: Energy Efficient Virtual Circuit Routing
inferred← citeshttps://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferred← citeshttps://doi.org/10.1137/s0097539799355314openalex-snapshot
Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1137/s089548010138917xopenalex-snapshot
A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
inferred← citeshttps://doi.org/10.1137/s089548019426560xopenalex-snapshot
Hypercubes and Multicommodity Flows
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.3929/ethz-a-004723738openalex-snapshot
Wavelength conversion in shortest-path all-optical networks
inferred← citeshttps://doi.org/10.3929/ethz-a-004832472openalex-snapshot
On the design and operation of high-performance optical networks
inferred← citeshttps://doi.org/10.48550/arxiv.2111.06163openalex-snapshot
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
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.