Pages that link to "Item:Q1104332"
From MaRDI portal
The following pages link to On submodular function minimization (Q1104332):
Displayed 19 items.
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- Submodular function minimization (Q995782) (← links)
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- Paths on polymatroids (Q1196722) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- The toughness of split graphs (Q1584388) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- A rounding technique for the polymatroid membership problem (Q1893104) (← links)
- Minimum cuts in parametric networks (Q1905228) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844) (← links)
- (Q5708558) (← links)
- A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)