Pages that link to "Item:Q1104332"
From MaRDI portal
The following pages link to On submodular function minimization (Q1104332):
Displaying 19 items.
- Submodular function minimization and related topics (Q3046539) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844) (← links)
- (Q3523377) (← links)
- Continuous limits of discrete perimeters (Q3552260) (← links)
- Minimum cuts, modular functions, and matroid polyhedra (Q3703586) (← links)
- On submodular value functions and complex dynamic programming (Q4221678) (← links)
- (Q4633864) (← links)
- (Q4633938) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization (Q5146821) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Learning submodular functions (Q5419150) (← links)
- (Q5708558) (← links)
- New Query Lower Bounds for Submodular Function Minimization (Q5875771) (← links)
- A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)
- Submodular Maximization With Limited Function Access (Q6047047) (← links)
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6606161) (← links)
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6646736) (← links)