Pages that link to "Item:Q5429271"
From MaRDI portal
The following pages link to A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271):
Displaying 15 items.
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← 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)
- On submodular function minimization (Q1104332) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017) (← links)
- Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- A tight analysis of the submodular-supermodular procedure (Q2345618) (← links)
- Polyhedral clinching auctions and the AdWords polytope (Q2796405) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Subquadratic submodular function minimization (Q4978061) (← links)
- Posimodular function optimization (Q5918641) (← links)
