On the public citation graph

New algorithms for the intersection problem of submodular systems

https://doi.org/10.1007/bf03167272
0 signed · 44 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/978-3-642-61586-3openalex-snapshot
Systems Analysis by Graphs and Matroids
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferredcites →https://doi.org/10.1007/978-3-662-22143-3openalex-snapshot
Matroid Theory and its Applications in Electric Network Theory and in Statics
inferredcites →https://doi.org/10.1016/0166-218x(87)90003-5openalex-snapshot
An out-of-kilter method for submodular flows
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1080/00207728108963728openalex-snapshot
Use of matroid theory in operations research, circuits and systems theory
inferredcites →https://doi.org/10.1137/0218072openalex-snapshot
Analysis of Preflow Push Algorithms for Maximum Network Flow
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
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

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-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/978-981-10-6147-9_4openalex-snapshot
Discrete Convex Functions on Graphs and Their Algorithmic Applications
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/s10107-021-01683-6openalex-snapshot
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
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-0076-yopenalex-snapshot
Simple push-relabel algorithms for matroids and submodular flows
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.dam.2012.05.025openalex-snapshot
Minimizing a sum of submodular functions
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.05.001openalex-snapshot
Separation of partition inequalities with terminals
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.1080/02331939608844244openalex-snapshot
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
inferred← citeshttps://doi.org/10.1109/focs.2018.00051openalex-snapshot
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms
inferred← citeshttps://doi.org/10.1109/isit.2018.8437754openalex-snapshot
Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503185openalex-snapshot
A combinatorial study of linear deterministic relay networks
inferred← citeshttps://doi.org/10.1109/synasc.2014.21openalex-snapshot
A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization
inferred← citeshttps://doi.org/10.1109/tit.2011.2120250openalex-snapshot
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch73openalex-snapshot
Finding a Stable Allocation in Polymatroid Intersection
inferred← citeshttps://doi.org/10.1137/s0895480199361533openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
inferred← citeshttps://doi.org/10.1137/s1052623499352012openalex-snapshot
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
inferred← citeshttps://doi.org/10.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.1145/3291531openalex-snapshot
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications
inferred← citeshttps://doi.org/10.1145/335305.335318openalex-snapshot
Improved algorithms for submodular function minimization and submodular flow
inferred← citeshttps://doi.org/10.1145/3729429openalex-snapshot
Faster Dynamic Auctions via Polymatroid Sum
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
inferred← citeshttps://doi.org/10.1287/moor.22.4.803openalex-snapshot
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1006.1990openalex-snapshot
Minimizing a sum of submodular functions
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03851openalex-snapshot
Revisiting Decomposable Submodular Function Minimization with Incidence Relations
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.