On the public citation graph
On submodular function minimization
0 signed · 116 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.1002/net.3230150206openalex-snapshot
Minimum cuts, modular functions, and matroid polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579341openalex-snapshot
Decomposition of submodular functions
inferredcites →https://doi.org/10.1016/0095-8956(84)90023-6openalex-snapshot
Testing membership in matroid polyhedra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
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-45535-3_13openalex-snapshot
Bisubmodular 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/978-1-4613-0303-9_12openalex-snapshot
Combinatorial Optimization and Coalition Games
inferred← citeshttps://doi.org/10.1007/978-1-4939-0742-7_2openalex-snapshot
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_13openalex-snapshot
Unions of Polytopes in Different Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-16194-1_4openalex-snapshot
Discrete Convex Optimization and Applications in Supply Chain Management
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_28openalex-snapshot
Earliest Arrival Transshipments in Networks with Multiple Sinks
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_3openalex-snapshot
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_24openalex-snapshot
Decomposition Algorithm for the Single Machine Scheduling Polytope
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_42openalex-snapshot
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_12openalex-snapshot
Submodular Function Maximization on the Bounded Integer Lattice
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_11openalex-snapshot
Network Design Problem with Cut Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_19openalex-snapshot
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_5openalex-snapshot
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_1openalex-snapshot
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_40openalex-snapshot
Demand Queries with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-981-97-0669-3_22openalex-snapshot
Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf01587085openalex-snapshot
Recognition problems for special classes of polynomials in 0–1 variables
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf02366447openalex-snapshot
Minimum cuts in parametric networks
inferred← citeshttps://doi.org/10.1007/s00373-006-0649-0openalex-snapshot
Toughness in Graphs – A Survey
inferred← citeshttps://doi.org/10.1007/s00453-021-00800-3openalex-snapshot
Dispersing Obnoxious Facilities on a Graph
inferred← citeshttps://doi.org/10.1007/s00493-019-3900-1openalex-snapshot
Submodular Minimization Under Congruency Constraints
inferred← citeshttps://doi.org/10.1007/s10107-003-0432-4openalex-snapshot
On unions and dominants of polytopes
inferred← citeshttps://doi.org/10.1007/s10107-006-0084-2openalex-snapshot
Submodular function minimization
inferred← citeshttps://doi.org/10.1007/s10107-007-0189-2openalex-snapshot
A faster strongly polynomial time algorithm for submodular function minimization
inferred← citeshttps://doi.org/10.1007/s10115-025-02466-7openalex-snapshot
Conflict-aware influence maximization on hostile-labeled social networks
inferred← citeshttps://doi.org/10.1007/s10479-024-06003-7openalex-snapshot
A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints
inferred← citeshttps://doi.org/10.1007/s10601-007-9037-5openalex-snapshot
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
inferred← citeshttps://doi.org/10.1007/s10878-024-01213-yopenalex-snapshot
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
inferred← citeshttps://doi.org/10.1007/s11263-009-0238-9openalex-snapshot
On Total Variation Minimization and Surface Evolution Using Parametric Maximum 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/0024-3795(93)00222-lopenalex-snapshot
A rounding technique for the polymatroid membership problem
inferred← citeshttps://doi.org/10.1016/0041-5553(89)90188-2openalex-snapshot
Representation of the lattice of optimal solutions in the problem of submodular function minimization
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.031openalex-snapshot
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.022openalex-snapshot
Efficient minimization of higher order submodular functions using monotonic Boolean functions
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.016openalex-snapshot
On the foundations and extremal structure of the holographic entropy cone
inferred← citeshttps://doi.org/10.1016/j.neunet.2020.07.011openalex-snapshot
Discretely-constrained deep network for weakly supervised segmentation
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.035openalex-snapshot
On additive approximate submodularity
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00156-3openalex-snapshot
The toughness of split graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00285-7openalex-snapshot
A strongly polynomial time algorithm for a constrained submodular optimization problem
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(02)00498-5openalex-snapshot
The base-matroid and inverse combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12005-2openalex-snapshot
Primal Integer Programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00055-1openalex-snapshot
More Progress on Tough Graphs - The Y2K Report
inferred← citeshttps://doi.org/10.1017/9781009490559.009openalex-snapshot
An Introduction to Transshipments Over Time
inferred← citeshttps://doi.org/10.1023/a:1012746124612openalex-snapshot
Submodular Functions in Problems of Synthesis of Networks
inferred← citeshttps://doi.org/10.1051/m2an/2009044openalex-snapshot
Continuous limits of discrete perimeters
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00822openalex-snapshot
Inference in Higher Order MRF-MAP Problems with Small and Large Cliques
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/focs52979.2021.00013openalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00030openalex-snapshot
Improved Lower Bounds for Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00126openalex-snapshot
Sparse Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/pimrc59610.2024.10817409openalex-snapshot
MIST: An Efficient Approach for Software-Defined Multicast in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/smartgrid.2010.5622045openalex-snapshot
Malicious Data Attacks on Smart Grid State Estimation: Attack Strategies and Countermeasures
inferred← citeshttps://doi.org/10.1109/tac.2023.3279336openalex-snapshot
A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem
inferred← citeshttps://doi.org/10.1109/tpwrs.2012.2187685openalex-snapshot
Computing Critical $k$-Tuples in Power Networks
inferred← citeshttps://doi.org/10.1109/tsg.2011.2163807openalex-snapshot
Malicious Data Attacks on the Smart Grid
inferred← citeshttps://doi.org/10.1109/tsp.2020.3046972openalex-snapshot
Discrete Signal Processing with Set Functions
inferred← citeshttps://doi.org/10.1137/1.9781611974782.52openalex-snapshot
Fast and Memory-Efficient Algorithms for Evacuation Problems
inferred← citeshttps://doi.org/10.1137/1.9781611975994.51openalex-snapshot
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
inferred← citeshttps://doi.org/10.1137/1.9781611977073.5openalex-snapshot
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch83openalex-snapshot
Shortest Cycles With Monotone Submodular Costs
inferred← citeshttps://doi.org/10.1137/22m147685xopenalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection
inferred← citeshttps://doi.org/10.1137/s0097539701397813openalex-snapshot
A Faster Scaling Algorithm for Minimizing Submodular Functions
inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot
Bisubmodular Function Minimization
inferred← citeshttps://doi.org/10.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.1142/s0218196707004244openalex-snapshot
ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
inferred← citeshttps://doi.org/10.1145/3055399.3055419openalex-snapshot
Subquadratic submodular function minimization
inferred← citeshttps://doi.org/10.1145/3313276.3316361openalex-snapshot
Polynomial pass lower bounds for graph streaming algorithms
inferred← citeshttps://doi.org/10.1145/3323679.3326519openalex-snapshot
MWSR over an Uplink Gaussian Channel with Box Constraints
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/335305.335318openalex-snapshot
Improved algorithms for submodular function minimization and submodular flow
inferred← citeshttps://doi.org/10.1145/3357713.3384287openalex-snapshot
A lower bound for parallel submodular minimization
inferred← citeshttps://doi.org/10.1145/3626824openalex-snapshot
Shortest Cycles with Monotone Submodular Costs
inferred← citeshttps://doi.org/10.1145/3638529.3654181openalex-snapshot
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
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.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
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/educ.2023.0255openalex-snapshot
Mixed-Integer Programming Approaches to Generalized Submodular Optimization and Its Applications
inferred← citeshttps://doi.org/10.1287/moor.2022.0320openalex-snapshot
On Constrained Mixed-Integer DR-Submodular Minimization
inferred← citeshttps://doi.org/10.1287/opre.1050.0252openalex-snapshot
A Nonparametric Approach to Multiproduct Pricing
inferred← citeshttps://doi.org/10.1287/opre.40.2.384openalex-snapshot
The Joint Replenishment Problem with General Joint Cost Structures
inferred← citeshttps://doi.org/10.1287/opre.43.3.458openalex-snapshot
Efficient Algorithms for Finding Optimal Power-of-Two Policies for Production/Distribution Systems with General Joint Setup Costs
inferred← citeshttps://doi.org/10.17877/de290r-939openalex-snapshot
Evacuation by earliest arrival flows
inferred← citeshttps://doi.org/10.21236/ada526806openalex-snapshot
The Structure of Optimal Solutions to the Submodular Function Minimization Problem
inferred← citeshttps://doi.org/10.26421/qic19.15-16-5openalex-snapshot
Quantum and classical algorithms for approximate submodular function minimization
inferred← citeshttps://doi.org/10.3990/1.9789036538275openalex-snapshot
Mechanisms for scheduling games with selfish players
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.144openalex-snapshot
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0804.1603openalex-snapshot
Linear Optimization over a Polymatroid with Side Constraints -- Scheduling Queues and Minimizing Submodular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1201.0469openalex-snapshot
Computing Critical $k$-tuples in Power Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05423openalex-snapshot
Submodular Function Maximization over Distributive and Integer Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09800openalex-snapshot
Subquadratic Submodular Function Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1907.05378openalex-snapshot
Quantum and Classical Algorithms for Approximate Submodular Function Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1911.06889openalex-snapshot
New Query Lower Bounds for Submodular Function MInimization
inferred← citeshttps://doi.org/10.5204/thesis.eprints.200748openalex-snapshot
Selected non-convex optimization problems in machine learning
inferred← citeshttps://doi.org/10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9openalex-snapshot
Quantum algorithms for the Monte Carlo method
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.