On the public citation graph

A capacity scaling algorithm for convex cost submodular flows

https://doi.org/10.1007/bf02614442
0 signed · 41 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/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferredcites →https://doi.org/10.1007/bf02592217openalex-snapshot
Structures of polyhedra determined by submodular functions on crossing families
inferredcites →https://doi.org/10.1007/bfb0121104openalex-snapshot
Solving integer minimum cost flows with separable convex cost objective polynomially
inferredcites →https://doi.org/10.1016/0095-8956(84)90029-7openalex-snapshot
Finding feasible vectors of Edmonds-Giles polyhedra
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)x7004-9openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferredcites →https://doi.org/10.1287/moor.10.2.251openalex-snapshot
A Primal-Dual Algorithm for Submodular Flows
inferredcites →https://doi.org/10.1287/moor.11.2.362openalex-snapshot
Layered Augmenting Path Algorithms
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.2000.0702openalex-snapshot
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions
inferred← citeshttps://doi.org/10.1006/jctb.2001.2072openalex-snapshot
A Fully Combinatorial Algorithm for Submodular Function Minimization
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_1openalex-snapshot
A Faster Scaling Algorithm for Minimizing Submodular Functions
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_20openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_27openalex-snapshot
A Capacity Scaling Algorithm for M-convex Submodular Flow
inferred← citeshttps://doi.org/10.1007/s00493-003-0030-3openalex-snapshot
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*
inferred← citeshttps://doi.org/10.1007/s10107-004-0562-3openalex-snapshot
A capacity scaling algorithm for M-convex submodular flow
inferred← citeshttps://doi.org/10.1007/s10107-006-0084-2openalex-snapshot
Submodular function minimization
inferred← citeshttps://doi.org/10.1007/s101070100253openalex-snapshot
A faster capacity scaling algorithm for minimum cost submodular flow
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1016/j.aam.2003.11.001openalex-snapshot
Quadratic M-convex and L-convex functions
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.025openalex-snapshot
Minimizing a sum of submodular functions
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.04.001openalex-snapshot
On the complexity of submodular function minimisation on diamonds
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00052-1openalex-snapshot
A fast cost scaling algorithm for submodular flow
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00458-4openalex-snapshot
A push-relabel framework for submodular function minimization and applications to parametric optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00051-7openalex-snapshot
Minimizing a submodular function arising from a concave function
inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferred← citeshttps://doi.org/10.1080/1055678031000099178openalex-snapshot
Capacity scaling algorithm for scalable M-convex submodular flow problems
inferred← citeshttps://doi.org/10.1109/tpami.2014.2388218openalex-snapshot
Generalized Flows for Optimal Inference in Higher Order MRF-MAP
inferred← citeshttps://doi.org/10.1137/s0097539701397813openalex-snapshot
A Faster Scaling Algorithm for Minimizing Submodular Functions
inferred← citeshttps://doi.org/10.1137/s0895480199361533openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
inferred← citeshttps://doi.org/10.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.1145/2213977.2213981openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.1145/335305.335317openalex-snapshot
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
inferred← citeshttps://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
inferred← citeshttps://doi.org/10.11606/d.45.2009.tde-03112010-231536openalex-snapshot
Minimização de funções submodulares
inferred← citeshttps://doi.org/10.21236/ada526806openalex-snapshot
The Structure of Optimal Solutions to the Submodular Function Minimization Problem
inferred← citeshttps://doi.org/10.5555/314613.314696openalex-snapshot
A faster algorithm for minimum cost submodular flows
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.