On the public citation graph

A faster capacity scaling algorithm for minimum cost submodular flow

https://doi.org/10.1007/s101070100253
0 signed · 56 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.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1006/jctb.2001.2072openalex-snapshot
A Fully Combinatorial Algorithm for Submodular Function Minimization
inferredcites →https://doi.org/10.1007/3-540-48777-8_20openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
inferredcites →https://doi.org/10.1007/bf01580882openalex-snapshot
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
inferredcites →https://doi.org/10.1007/bf01585712openalex-snapshot
A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions
inferredcites →https://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferredcites →https://doi.org/10.1007/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02592217openalex-snapshot
Structures of polyhedra determined by submodular functions on crossing families
inferredcites →https://doi.org/10.1007/bf02614442openalex-snapshot
A capacity scaling algorithm for convex cost submodular flows
inferredcites →https://doi.org/10.1007/bf03167272openalex-snapshot
New algorithms for the intersection problem of submodular systems
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/0166-218x(92)00188-ropenalex-snapshot
Computing maximum mean cuts
inferredcites →https://doi.org/10.1016/0166-218x(93)90025-jopenalex-snapshot
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
inferredcites →https://doi.org/10.1016/s0020-0190(00)00052-1openalex-snapshot
A fast cost scaling algorithm for submodular flow
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.1109/sfcs.1992.267785openalex-snapshot
Newton's method for fractional combinatorial optimization
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/335305.335317openalex-snapshot
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1145/335305.335318openalex-snapshot
Improved algorithms for submodular function minimization and submodular flow
inferredcites →https://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
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.1287/moor.14.1.60openalex-snapshot
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
inferredcites →https://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferredcites →https://doi.org/10.1287/moor.7.3.334openalex-snapshot
Computing Maximal “Polymatroidal” Network Flows
inferredcites →https://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
inferredcites →https://doi.org/10.15807/jorsj.26.309openalex-snapshot
A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
inferredcites →https://doi.org/10.3929/ethz-a-000219963openalex-snapshot
Ganzzahlige Polymatroid-Intersektions-Algorithmen
inferredcites →https://doi.org/10.5555/314613.314696openalex-snapshot
A faster algorithm for minimum cost submodular flows

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-47867-1_1openalex-snapshot
A Faster Scaling Algorithm for Minimizing Submodular Functions
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/s13160-012-0084-yopenalex-snapshot
Lattice polyhedra and submodular flows
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.dam.2020.02.005openalex-snapshot
The b -branching problem in digraphs
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/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/02533839.2013.815010openalex-snapshot
A Dantzig–Wolfe decomposition algorithm for the constrained minimum cost flow problem
inferred← citeshttps://doi.org/10.1080/1055678031000099178openalex-snapshot
Capacity scaling algorithm for scalable M-convex submodular flow problems
inferred← citeshttps://doi.org/10.1109/focs.2015.68openalex-snapshot
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
inferred← citeshttps://doi.org/10.1109/jiot.2023.3270436openalex-snapshot
Backup Battery Allocation and Workload Migration Against Electrical Load Shedding at Edge
inferred← citeshttps://doi.org/10.1109/tmc.2007.70743openalex-snapshot
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks
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/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.1287/moor.2018.0976openalex-snapshot
Finding a Stable Allocation in Polymatroid Intersection
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.