On the public citation graph

On-Line Load Balancing and Network Flow

https://doi.org/10.1007/pl00009214
0 signed · 26 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.1002/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot
A Faster Deterministic Maximum Flow Algorithm
inferredcites →https://doi.org/10.1006/jagm.1995.0799openalex-snapshot
On-Line Load Balancing of Temporary Tasks
inferredcites →https://doi.org/10.1006/jagm.1995.1008openalex-snapshot
The Competitiveness of On-Line Assignments
inferredcites →https://doi.org/10.1016/0020-0190(90)90024-ropenalex-snapshot
Generating pseudo-random permutations and maximum flow algorithms
inferredcites →https://doi.org/10.1016/0304-3975(94)90153-8openalex-snapshot
On-line load balancing
inferredcites →https://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1137/s0097539791278376openalex-snapshot
An $o(n^3 )$-Time Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/129712.129718openalex-snapshot
New algorithms for an ancient scheduling problem
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.22169openalex-snapshot
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
inferred← citeshttps://doi.org/10.1006/jagm.2000.1074openalex-snapshot
Load Balancing for Response Time
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_85openalex-snapshot
Online Load Balancing Made Simple: Greedy Strikes Back
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_155openalex-snapshot
Load balancing for response time
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_14openalex-snapshot
Fully-Dynamic Load Balancing
inferred← citeshttps://doi.org/10.1007/978-981-19-1677-9_56openalex-snapshot
Network Load Balancing for Edge-Cloud Continuum Ecosystems
inferred← citeshttps://doi.org/10.1007/s00453-006-1211-4openalex-snapshot
Selfish Load Balancing and Atomic Congestion Games
inferred← citeshttps://doi.org/10.1007/s10107-025-02310-4openalex-snapshot
Fully-Dynamic Load Balancing
inferred← citeshttps://doi.org/10.1016/j.jda.2006.02.001openalex-snapshot
On-line load balancing made simple: Greedy strikes back
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00341-xopenalex-snapshot
On-line algorithms for the channel assignment problem in cellular networks
inferred← citeshttps://doi.org/10.1137/1.9781611975031.61openalex-snapshot
Online Bipartite Matching with Amortized Replacements
inferred← citeshttps://doi.org/10.1145/1007912.1007941openalex-snapshot
Selfish load balancing and atomic congestion games
inferred← citeshttps://doi.org/10.1145/3055399.3055493openalex-snapshot
Online and dynamic algorithms for set cover
inferred← citeshttps://doi.org/10.1145/3344999openalex-snapshot
Online Bipartite Matching with Amortized O (log 2 n ) Replacements
inferred← citeshttps://doi.org/10.15807/jorsj.43.2openalex-snapshot
RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS
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.