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.
- 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)
- Submodular function minimization and polarity (Q2097629) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
- Who should get vaccinated? Individualized allocation of vaccines over SIR network (Q2106396) (← links)
- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization (Q2112685) (← links)
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models (Q2116913) (← links)
- Optimal intervention in economic networks using influence maximization methods (Q2116936) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Dual domination problems in graphs (Q2136849) (← links)
- Modeling the spread of infectious diseases through influence maximization (Q2136893) (← links)
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
- On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks (Q2143143) (← links)
- Union acceptable profit maximization in social networks (Q2143149) (← links)
- Ranking with submodular functions on a budget (Q2147409) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Maximize the probability of union-influenced in social networks (Q2149879) (← links)
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
- Streaming submodular maximization under differential privacy noise (Q2150568) (← links)
- A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
- Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint (Q2151371) (← links)
- Fixed observation time-step: adaptive influence maximization (Q2151373) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- \(T \times\)\textit{one Hop} approach for dynamic influence maximization problem (Q2155438) (← links)
- Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
- Parameterized approximations for the two-sided assortment optimization (Q2157918) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants (Q2163754) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Gaussian downlink user selection subject to access limit, power budget, and rate demands (Q2167901) (← links)
- Election control through social influence with voters' uncertainty (Q2168756) (← links)
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
- Game theoretic resource allocation model for designing effective traffic safety solution against drunk driving (Q2177693) (← 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)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- Target users' activation probability maximization with different seed set constraints in social networks (Q2197539) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
