On the public citation graph
A new scaling algorithm for the maximum mean cut problem
0 signed · 31 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/bf01840350openalex-snapshot
A linear time randomizing algorithm for searching ranked functions
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/0167-6377(92)90048-8openalex-snapshot
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
inferredcites →https://doi.org/10.1109/fscs.1990.89592openalex-snapshot
A fast algorithm for optimally increasing the edge-connectivity
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
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/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
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.10000openalex-snapshot
Minimax inverse problems of minimum cuts
inferred← citeshttps://doi.org/10.1006/jagm.1996.0849openalex-snapshot
Choosing Subsets with Maximum Weighted Average
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_144openalex-snapshot
Bilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problem; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory;…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_188openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_62openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_6openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_188-1openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf01240734openalex-snapshot
Tight bounds on the number of minimum-mean cycle cancellations and related results
inferred← citeshttps://doi.org/10.1007/bf02614370openalex-snapshot
How to compute least infeasible flows
inferred← citeshttps://doi.org/10.1007/s10898-016-0487-4openalex-snapshot
Fractional 0–1 programming: applications and algorithms
inferred← citeshttps://doi.org/10.1007/s10898-022-01131-5openalex-snapshot
Fractional 0–1 programming and submodularity
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00188-ropenalex-snapshot
Computing maximum mean cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90025-jopenalex-snapshot
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90022-9openalex-snapshot
Approximate binary search algorithms for mean cuts and cycles
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00115-xopenalex-snapshot
An approximate binary search algorithm for the multiple-choice knapsack problem
inferred← citeshttps://doi.org/10.1137/s0097539794263695openalex-snapshot
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
inferred← citeshttps://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferred← citeshttps://doi.org/10.15807/torsj.53.1openalex-snapshot
A MAXIMUM DENSITY SUBSET PROBLEM AND ITS ALGORITHM WITH APPROXIMATE BINARY SEARCH
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07235openalex-snapshot
Fractional 0-1 programming and submodularity
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.