scientific article
From MaRDI portal
Publication:3112637
zbMath1230.90141MaRDI QIDQ3112637
No author found.
Publication date: 12 January 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (68)
Ignorant vs. Anonymous Recommendations ⋮ Robust Adaptive Submodular Maximization ⋮ Adaptive Rumor Spreading ⋮ Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice ⋮ Fixed observation time-step: adaptive influence maximization ⋮ Robust Monotone Submodular Function Maximization ⋮ Submodular Stochastic Probing on Matroids ⋮ Decision tree classification with bounded number of errors ⋮ Submodular learning and covering with response-dependent costs ⋮ Stochastic-lazier-greedy algorithm for monotone non-submodular maximization ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline ⋮ Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning ⋮ Streaming adaptive submodular maximization ⋮ Seeding with Costly Network Information ⋮ A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity ⋮ Annotation cost-sensitive active learning by tree sampling ⋮ Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems ⋮ Better bounds on the adaptivity gap of influence maximization under full-adoption feedback ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ Constrained stochastic submodular maximization with state-dependent costs ⋮ Partial-adaptive submodular maximization ⋮ Stochastic Probing with Increasing Precision ⋮ Math‐based reinforcement learning for the adaptive budgeted influence maximization problem ⋮ Submodular goal value of Boolean functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Scenario Submodular Cover ⋮ Group fairness in non-monotone submodular maximization ⋮ Adaptive Submodular Ranking and Routing ⋮ Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time ⋮ Stochastic block-coordinate gradient projection algorithms for submodular maximization ⋮ A unifying look at sequence submodularity ⋮ Measuring the impact of MVC attack in large complex networks ⋮ Evaluation of monotone DNF formulas ⋮ Robust budget allocation via continuous submodular functions ⋮ Unnamed Item ⋮ Dynamic competition over social networks ⋮ Discount allocation for cost minimization in online social networks ⋮ On competitive recommendations ⋮ Streaming adaptive submodular maximization ⋮ Adaptive robust submodular optimization and beyond ⋮ Sequence submodular maximization meets streaming ⋮ Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint ⋮ Price of dependence: stochastic submodular maximization with dependent items ⋮ Robust monotone submodular function maximization ⋮ Stochastic submodular probing with state-dependent costs ⋮ Stochastic submodular probing with state-dependent costs ⋮ Influence maximization with partial feedback ⋮ Parallelized maximization of nonsubmodular function subject to a cardinality constraint ⋮ Novel algorithms for maximum DS decomposition ⋮ On Monte-Carlo tree search for deterministic games with alternate moves and complete information ⋮ Learning to Optimize via Information-Directed Sampling ⋮ Non-submodular maximization on massive data streams ⋮ The stochastic Boolean function evaluation problem for symmetric Boolean functions ⋮ Submodular Maximization with Uncertain Knapsack Capacity ⋮ Unnamed Item ⋮ Adaptive influence maximization under fixed observation time-step ⋮ Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints ⋮ Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice ⋮ A Tight Bound for Stochastic Submodular Cover ⋮ Time bounded adaptive information coverage in social networks ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ Unnamed Item ⋮ Partial-monotone adaptive submodular maximization ⋮ Two approximation algorithms for maximizing nonnegative weakly monotonic set functions ⋮ Adaptive seeding for profit maximization in social networks
Uses Software
This page was built for publication:
