On the public citation graph
Exact and approximation algorithms for network flow and disjoint-path problems.
0 signed · 87 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.1002/(sici)1098-2418(199701/03)10:1/2<205::aid-rsa11>3.0.co;2-7openalex-snapshot
On the all-pairs shortest-path algorithm of Moffat and Takaoka
inferredcites →https://doi.org/10.1002/(sici)1098-2418(1999010)14:1<87::aid-rsa5>3.0.co;2-oopenalex-snapshot
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach
inferredcites →https://doi.org/10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0openalex-snapshot
Average-case complexity of shortest-paths problems in the vertex-potential model
inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1002/net.3230100205openalex-snapshot
An algorithm to solve the m × n assignment problem in expected time O(mn log n)
inferredcites →https://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1006/jagm.1998.0937openalex-snapshot
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
inferredcites →https://doi.org/10.1006/jcss.1997.1388openalex-snapshot
On the Exponent of the All Pairs Shortest Path Problem
inferredcites →https://doi.org/10.1007/3-540-61310-2_29openalex-snapshot
A new approach to computing optimal schedules for the job-shop scheduling problem
inferredcites →https://doi.org/10.1007/3-540-61310-2_8openalex-snapshot
Finding real-valued single-source shortest paths in o(n 3) expected time
inferredcites →https://doi.org/10.1007/3-540-69346-7_12openalex-snapshot
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01585178openalex-snapshot
An approximation algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/bf01840353openalex-snapshot
Global wire routing in two-dimensional arrays
inferredcites →https://doi.org/10.1007/bf02122549openalex-snapshot
Optima of dual integer linear programs
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
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/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferredcites →https://doi.org/10.1007/bfb0022539openalex-snapshot
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem
inferredcites →https://doi.org/10.1007/bfb0030835openalex-snapshot
Shortest paths in random weighted graphs
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0012-365x(78)90164-4openalex-snapshot
On graphs with hamiltonian squares
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
inferredcites →https://doi.org/10.1016/0022-0000(88)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/0095-8956(74)90091-4openalex-snapshot
The square of every two-connected graph is Hamiltonian
inferredcites →https://doi.org/10.1016/0166-218x(85)90059-9openalex-snapshot
The shortest-path problem for graphs with random arc-lengths
inferredcites →https://doi.org/10.1109/49.400667openalex-snapshot
Competitive routing of virtual circuits in ATM networks
inferredcites →https://doi.org/10.1109/fscs.1990.89595openalex-snapshot
Approximation through multicommodity flow
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/sfcs.1995.492462openalex-snapshot
Disjoint paths in densely embedded graphs
inferredcites →https://doi.org/10.1109/sfcs.1996.548465openalex-snapshot
Single-source unsplittable flow
inferredcites →https://doi.org/10.1109/sfcs.1996.548467openalex-snapshot
Short paths in expander graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646087openalex-snapshot
Beyond the flow decomposition barrier
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.1998.743461openalex-snapshot
On the single-source unsplittable flow problem
inferredcites →https://doi.org/10.1137/0202004openalex-snapshot
A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0206050openalex-snapshot
A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
inferredcites →https://doi.org/10.1137/0212039openalex-snapshot
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
inferredcites →https://doi.org/10.1137/0216065openalex-snapshot
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/0222071openalex-snapshot
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1137/s009753979222676xopenalex-snapshot
Improved Approximation Algorithms for Shop Scheduling Problems
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.1137/s089548019120016xopenalex-snapshot
Algorithms for Square Roots of Graphs
inferredcites →https://doi.org/10.1145/103418.103425openalex-snapshot
Fast approximation algorithms for multicommodity flow problems
inferredcites →https://doi.org/10.1145/129712.129784openalex-snapshot
On the all-pairs-shortest-path problem
inferredcites →https://doi.org/10.1145/225058.225075openalex-snapshot
Approximations for the disjoint paths problem in high-diameter planar networks
inferredcites →https://doi.org/10.1145/225058.225138openalex-snapshot
Improved approximations of packing and covering problems
inferredcites →https://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferredcites →https://doi.org/10.1145/258533.258658openalex-snapshot
A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria
inferredcites →https://doi.org/10.1145/28395.28397openalex-snapshot
Solving minimum-cost flow problems by successive approximation
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/322047.322048openalex-snapshot
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1201/9781420010749-44openalex-snapshot
Multidimensional Packing Problems
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.1287/mnsc.6.2.187openalex-snapshot
On the Shortest Route Through a Network
inferredcites →https://doi.org/10.1287/moor.10.4.557openalex-snapshot
On Shortest Paths in Graphs with Random Weights
inferredcites →https://doi.org/10.1287/moor.20.2.257openalex-snapshot
Fast Approximation Algorithms for Fractional Packing and Covering Problems
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.5555/313651.313820openalex-snapshot
Improved bounds for all optical routing
inferredcites →https://doi.org/10.5555/313852.313866openalex-snapshot
An extension of the Lovász local lemma, and its applications to integer programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_13openalex-snapshot
On the k-Splittable Flow Problem
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_25openalex-snapshot
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1007/s00453-005-1167-9openalex-snapshot
The k-Splittable Flow Problem
inferred← citeshttps://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferred← citeshttps://doi.org/10.1007/s101070100260openalex-snapshot
Approximating the single source unsplittable min-cost flow problem
inferred← citeshttps://doi.org/10.1016/j.comcom.2021.04.008openalex-snapshot
A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00066-7openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892073openalex-snapshot
Approximating the single source unsplittable min-cost flow problem
inferred← citeshttps://doi.org/10.1145/1290672.1290683openalex-snapshot
Edge-disjoint paths revisited
inferred← citeshttps://doi.org/10.1201/9781420010749.ch57openalex-snapshot
Edge-Disjoint Paths and Unsplittable Flow
inferred← citeshttps://doi.org/10.2298/yjor181015034bopenalex-snapshot
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
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.