Pages that link to "Item:Q5954088"
From MaRDI portal
The following pages link to An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. (Q5954088):
Displaying 8 items.
- Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
- Approximate solution of the \(p\)-median minimization problem (Q519693) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
- Optimization of stochastic virus detection in contact networks (Q1785322) (← links)
- A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
- (Q5053276) (← links)
- Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region (Q5932864) (← links)
