Pages that link to "Item:Q4152030"
From MaRDI portal
The following pages link to An analysis of approximations for maximizing submodular set functions—I (Q4152030):
Displaying 50 items.
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
- Locating flow-intercepting facilities: New approaches and results (Q1908283) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Scalable influence maximization for independent cascade model in large-scale social networks (Q1945007) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Rumor correction maximization problem in social networks (Q1998850) (← links)
- Measures minimizing regularized dispersion (Q1999876) (← links)
- An exact solution framework for the multiple gradual cover location problem (Q2003421) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Nonnegative definite Hermitian matrices with increasing principal minors (Q2017183) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
- A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
- On strict submodularity of social influence (Q2025076) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
- Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
- Functional pearl: the distributive \(\lambda\)-calculus (Q2039932) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Utilitarian welfare and representation guarantees of approval-based multiwinner rules (Q2046010) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- Attribute based diversification of seeds for targeted influence maximization (Q2055595) (← links)
- Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations (Q2057377) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Adaptive influence maximization under fixed observation time-step (Q2079873) (← links)
- Permutatorial optimization via the permutahedron (Q2083997) (← links)
- Data source selection for approximate query (Q2084622) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- Motif-role extraction in uncertain graph based on efficient ensembles (Q2086630) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints (Q2087465) (← links)
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
- The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
- An ascending implementation of the Vickrey-Clarke-Groves mechanism for the licensed shared access (Q2090241) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
- Algorithms for influence maximization in socio-physical networks (Q2095554) (← links)
