Pages that link to "Item:Q1850585"
From MaRDI portal
The following pages link to A fully combinatorial algorithm for submodular function minimization. (Q1850585):
Displaying 16 items.
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Submodular function minimization (Q995782) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- A note on Schrijver's submodular function minimization algorithm. (Q1400972) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
- Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations (Q2848561) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- (Q3523377) (← links)
- (Q4633938) (← links)