Pages that link to "Item:Q790044"
From MaRDI portal
The following pages link to Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044):
Displaying 50 items.
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← 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 bounds with curvature for batched greedy optimization (Q725886) (← links)
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)
- On the geometric structure of independence systems (Q1824559) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Online BP functions maximization (Q2039657) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- Rank axiom of modular supermatroids: a connection with directional DR submodular functions (Q2070084) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
- Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees (Q2184512) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Influence maximization in the presence of vulnerable nodes: a ratio perspective (Q2220831) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Improved bounds for the greedy strategy in optimization problems with curvature (Q2424717) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid (Q2670444) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- (Q2958605) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
