On the public citation graph

The all-or-nothing multicommodity flow problem

https://doi.org/10.1145/1007352.1007383
0 signed · 121 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-45061-0_34openalex-snapshot
Multicommodity Demand Flow in a Tree
inferredcites →https://doi.org/10.1007/3-540-45535-3_2openalex-snapshot
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/3-540-56939-1_62openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferredcites →https://doi.org/10.1007/bf02579324openalex-snapshot
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
inferredcites →https://doi.org/10.1007/s00453-005-1172-zopenalex-snapshot
Combinatorial Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s00453-006-1210-5openalex-snapshot
Approximation Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s004930050043openalex-snapshot
On the Single-Source Unsplittable Flow Problem
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0020-0190(03)00351-xopenalex-snapshot
A note on the greedy algorithm for the unsplittable flow problem
inferredcites →https://doi.org/10.1016/s0022-0000(03)00066-7openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferredcites →https://doi.org/10.1109/49.400667openalex-snapshot
Competitive routing of virtual circuits in ATM networks
inferredcites →https://doi.org/10.1109/focs.2004.27openalex-snapshot
Edge-Disjoint Paths in Planar Graphs
inferredcites →https://doi.org/10.1109/hicss.1998.649241openalex-snapshot
Multicommodity flow and circuit switching
inferredcites →https://doi.org/10.1109/sfcs.1993.366884openalex-snapshot
Throughput-competitive on-line routing
inferredcites →https://doi.org/10.1109/sfcs.1994.365733openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1996.548465openalex-snapshot
Single-source unsplittable flow
inferredcites →https://doi.org/10.1109/sfcs.1997.646130openalex-snapshot
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
inferredcites →https://doi.org/10.1109/sfcs.1997.646131openalex-snapshot
Improved approximation algorithms for unsplittable flow problems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181881openalex-snapshot
Minimizing congestion in general networks
inferredcites →https://doi.org/10.1109/sfcs.2005.18openalex-snapshot
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.41openalex-snapshot
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferredcites →https://doi.org/10.1137/s0097539799356265openalex-snapshot
On Multidimensional Packing Problems
inferredcites →https://doi.org/10.1145/1007352.1007364openalex-snapshot
New hardness results for congestion minimization and machine scheduling
inferredcites →https://doi.org/10.1145/1060590.1060618openalex-snapshot
Multicommodity flow, well-linked terminals, and routing problems
inferredcites →https://doi.org/10.1145/1073970.1073996openalex-snapshot
Finding effective support-tree preconditioners
inferredcites →https://doi.org/10.1145/1290672.1290683openalex-snapshot
Edge-disjoint paths revisited
inferredcites →https://doi.org/10.1145/258128.258201openalex-snapshot
On-line routing of virtual circuits with applications to load balancing and machine scheduling
inferredcites →https://doi.org/10.1145/301250.301262openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferredcites →https://doi.org/10.1145/304893.304983openalex-snapshot
Small distortion and volume preserving embeddings for planar and Euclidean metrics
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/777412.777418openalex-snapshot
A practical algorithm for constructing oblivious routing schemes
inferredcites →https://doi.org/10.1145/777412.777419openalex-snapshot
A polynomial-time tree decomposition to minimize congestion
inferredcites →https://doi.org/10.1145/777412.777420openalex-snapshot
Online oblivious routing
inferredcites →https://doi.org/10.1145/780542.780599openalex-snapshot
Optimal oblivious routing in polynomial time
inferredcites →https://doi.org/10.1145/863955.863991openalex-snapshot
Making intra-domain routing robust to changing and uncertain traffic demands
inferredcites →https://doi.org/10.1201/9781420010749-44openalex-snapshot
Multidimensional Packing Problems
inferredcites →https://doi.org/10.5555/982792.982846openalex-snapshot
Graph decomposition and a greedy algorithm for edge-disjoint paths

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11786986_19openalex-snapshot
Edge Disjoint Paths in Moderately Connected Graphs
inferred← citeshttps://doi.org/10.1007/11970125_3openalex-snapshot
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_261openalex-snapshot
Oblivious Routing
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-84882-765-3_6openalex-snapshot
Resource Allocation Algorithms for the Next Generation Cellular Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_10openalex-snapshot
LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_23openalex-snapshot
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_26openalex-snapshot
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_20openalex-snapshot
Single-Sink Multicommodity Flow with Side Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_43openalex-snapshot
Survey on Oblivious Routing Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_23openalex-snapshot
Thresholded Covering Algorithms for Robust and Max-min Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_22openalex-snapshot
Improved Algorithm for the Half-Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_2openalex-snapshot
The Disjoint Paths Problem: Algorithm and Structure
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_64openalex-snapshot
Improved Guarantees for Tree Cut Sparsifiers
inferred← citeshttps://doi.org/10.1007/978-4-431-55756-2_9openalex-snapshot
Some Recent Progress for Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_3openalex-snapshot
Fair $$ k $$-Center Clustering with Minimum Representation Guarantees
inferred← citeshttps://doi.org/10.1007/s00453-007-9129-zopenalex-snapshot
A Note on Multiflows and Treewidth
inferred← citeshttps://doi.org/10.1007/s00493-010-2455-9openalex-snapshot
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
inferred← citeshttps://doi.org/10.1007/s10107-013-0705-5openalex-snapshot
Thresholded covering algorithms for robust and max–min optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01780-0openalex-snapshot
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
inferred← citeshttps://doi.org/10.1007/s12243-017-0618-zopenalex-snapshot
Provisioning dynamic and critical demand structures for geographically correlated failures
inferred← citeshttps://doi.org/10.1016/j.apenergy.2018.06.021openalex-snapshot
Power-traffic coordinated operation for bi-peak shaving and bi-ramp smoothing – A hierarchical data-driven approach
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109659openalex-snapshot
Auto-tune: An efficient autonomous multi-path payment routing algorithm for Payment Channel Networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.09.011openalex-snapshot
Online constrained optimization with recourse
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.07.004openalex-snapshot
The disjoint paths problem in quadratic time
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.009openalex-snapshot
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms
inferred← citeshttps://doi.org/10.1109/apcc.2005.1554086openalex-snapshot
BGP Ingress-to-Egress Route Configuration in a Capacity-constrained AS
inferred← citeshttps://doi.org/10.1109/cluster.2015.16openalex-snapshot
Taming Non-local Stragglers Using Efficient Prefetching in MapReduce
inferred← citeshttps://doi.org/10.1109/focs.2004.27openalex-snapshot
Edge-Disjoint Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/focs.2006.39openalex-snapshot
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
inferred← citeshttps://doi.org/10.1109/focs.2007.21openalex-snapshot
Buy-at-Bulk Network Design with Protection
inferred← citeshttps://doi.org/10.1109/focs.2010.33openalex-snapshot
Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
inferred← citeshttps://doi.org/10.1109/focs.2011.30openalex-snapshot
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
inferred← citeshttps://doi.org/10.1109/focs.2011.52openalex-snapshot
The Graph Minor Algorithm with Parity Conditions
inferred← citeshttps://doi.org/10.1109/focs.2012.54openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.1109/focs.2013.28openalex-snapshot
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs
inferred← citeshttps://doi.org/10.1109/icc59461.2026.11586965openalex-snapshot
Hybrid Routing with Load-Balanced Resource Allocation in FSO-Assisted Data Center QNs
inferred← citeshttps://doi.org/10.1109/infocom.2008.120openalex-snapshot
Cell Selection in 4G Cellular Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.4544585openalex-snapshot
Covering all bases with a short blanket: A dynamic monitoring resource allocation scheme
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737402openalex-snapshot
A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161067openalex-snapshot
Coupled placement in modern data centers
inferred← citeshttps://doi.org/10.1109/izs.2006.1649081openalex-snapshot
Approaches to Network Coding for Multiple Unicasts
inferred← citeshttps://doi.org/10.1109/noms.2016.7502799openalex-snapshot
Protecting virtual networks with DRONE
inferred← citeshttps://doi.org/10.1109/sfcs.2005.18openalex-snapshot
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.2005.41openalex-snapshot
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
inferred← citeshttps://doi.org/10.1109/tccn.2021.3139632openalex-snapshot
Dynamic Topology Design of NFV-Enabled Services Using Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tmc.2012.83openalex-snapshot
Cell Selection in 4G Cellular Networks
inferred← citeshttps://doi.org/10.1109/tmlcn.2025.3615119openalex-snapshot
A Reinforcement Learning-Based Hybrid Scheduling Mechanism for mmWave Networks
inferred← citeshttps://doi.org/10.1109/tnet.2016.2594235openalex-snapshot
Guaranteeing Deadlines for Inter-Data Center Transfers
inferred← citeshttps://doi.org/10.1109/tnet.2022.3216592openalex-snapshot
Achieving High Availability in Inter-DC WAN Traffic Engineering
inferred← citeshttps://doi.org/10.1109/vtcspring.2019.8746596openalex-snapshot
Large Data Transfers in IoVs Using Direct Links
inferred← citeshttps://doi.org/10.1137/060674442openalex-snapshot
Edge-Disjoint Paths in Planar Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.1137/080715093openalex-snapshot
Edge Disjoint Paths in Moderately Connected Graphs
inferred← citeshttps://doi.org/10.1145/1052796.1052808openalex-snapshot
Three dozen papers on online algorithms
inferred← citeshttps://doi.org/10.1145/1060590.1060618openalex-snapshot
Multicommodity flow, well-linked terminals, and routing problems
inferred← citeshttps://doi.org/10.1145/1060590.1060619openalex-snapshot
Oblivious routing in directed graphs with random demands
inferred← citeshttps://doi.org/10.1145/1060590.1060632openalex-snapshot
Hardness of the undirected edge-disjoint paths problem
inferred← citeshttps://doi.org/10.1145/1132516.1132621openalex-snapshot
Edge-disjoint paths in Planar graphs with constant congestion
inferred← citeshttps://doi.org/10.1145/1183907.1183910openalex-snapshot
Logarithmic hardness of the undirected edge-disjoint paths problem
inferred← citeshttps://doi.org/10.1145/1250790.1250816openalex-snapshot
Hardness of routing with congestion in directed graphs
inferred← citeshttps://doi.org/10.1145/1273340.1273343openalex-snapshot
Multicommodity demand flow in a tree and packing integer programs
inferred← citeshttps://doi.org/10.1145/1290672.1290688openalex-snapshot
Oblivious routing on node-capacitated and directed graphs
inferred← citeshttps://doi.org/10.1145/1324215.1324236openalex-snapshot
Routing and network design with robustness to changing or uncertain traffic demands
inferred← citeshttps://doi.org/10.1145/1993636.1993648openalex-snapshot
Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two
inferred← citeshttps://doi.org/10.1145/2213977.2214039openalex-snapshot
On vertex sparsifiers with Steiner nodes
inferred← citeshttps://doi.org/10.1145/2213977.2214040openalex-snapshot
Approximation algorithms and hardness of integral concurrent flow
inferred← citeshttps://doi.org/10.1145/2213977.2214054openalex-snapshot
Routing in undirected graphs with constant congestion
inferred← citeshttps://doi.org/10.1145/2488608.2488645openalex-snapshot
Large-treewidth graph decompositions and applications
inferred← citeshttps://doi.org/10.1145/2893472openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.1145/3491042openalex-snapshot
Competitive Algorithms for Online Multidimensional Knapsack Problems
inferred← citeshttps://doi.org/10.1145/3529113.3529121openalex-snapshot
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
inferred← citeshttps://doi.org/10.1184/r1/6619763openalex-snapshot
Routing, Disjoint Paths, and Classification (CMU-PDL-06-109)
inferred← citeshttps://doi.org/10.1287/moor.1110.0484openalex-snapshot
Buy-at-Bulk Network Design with Protection
inferred← citeshttps://doi.org/10.1561/9781601982179openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.23919/inm.2017.7987271openalex-snapshot
ReViNE: Reallocation of Virtual Network Embedding to eliminate substrate bottlenecks
inferred← citeshttps://doi.org/10.4086/toc.2006.v002a007openalex-snapshot
inferred← citeshttps://doi.org/10.5555/1070432.1070542openalex-snapshot
Oblivious routing on node-capacitated and directed graphs
inferred← citeshttps://doi.org/10.5555/1109557.1109658openalex-snapshot
New lower bounds for oblivious routing in undirected graphs
inferred← citeshttps://doi.org/10.5555/1109557.1109665openalex-snapshot
Oblivious network design
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.