An analysis of approximations for maximizing submodular set functions—I
From MaRDI portal
Publication:4152030
DOI10.1007/BF01588971zbMath0374.90045WikidataQ56814664 ScholiaQ56814664MaRDI QIDQ4152030
Marshall L. Fisher, Laurence A. Wolsey, Nemhauser, George I.
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Unimodular functions, Streaming algorithms for robust submodular maximization, An approximation algorithm for maximum weight budgeted connected set cover, Influence maximization problem: properties and algorithms, Inferring range of information diffusion based on historical frequent items, Sensor placement for fault location identification in water networks: a minimum test cover approach, Micro- and macromodels of social networks. I: Theory fundamentals, On an approximation measure founded on the links between optimization and polynomial approximation theory, Multi-level facility location as the maximization of a submodular set function, The component commonality problem in a real multidimensional space: an algorithmic approach, Finding a collective set of items: from proportional multirepresentation to group recommendation, Strong formulations for quadratic optimization with M-matrices and indicator variables, Optimal interval scheduling with a resource constraint, On covering location problems on networks with edge demand, On a class of functions attaining their maximum at the vertices of a polyhedron, Directed submodularity, ditroids and directed submodular flows, Submodular learning and covering with response-dependent costs, A fast algorithm for finding matching responses in a survey data table, Submodularity and valid inequalities in capacitated fixed charge networks, Pick-and-choose heuristics for partial set covering, Submodularity and the traveling salesman problem, Decision trees for function evaluation: simultaneous optimization of worst and expected cost, FPT approximation schemes for maximizing submodular functions, Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications, On the approximability of the link building problem, An accelerated continuous greedy algorithm for maximizing strong submodular functions, Clustering on trees, Thresholded covering algorithms for robust and max-min optimization, Discriminative models for multi-class object layout, Fast approximate energy minimization with label costs, Structure preserving reductions among convex optimization problems, Submodular maximization meets streaming: matchings, matroids, and more, Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems, A cost operator approach to multistage location-allocation, On general threshold and general cascade models of social influence, Efficient influence maximization under TSCM: a suitable diffusion model in online social networks, Rough set methods in feature selection via submodular function, A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem, Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks, Locating service facilities whose reliability is distance dependent., Stochastic block-coordinate gradient projection algorithms for submodular maximization, Is submodularity testable?, A note on maximizing a submodular set function subject to a knapsack constraint, Computational complexity analysis of the sensor location flow observability problem, Recommending links through influence maximization, Multi-attribute proportional representation, Budgeted nature reserve selection with diversity feature loss and arbitrary split systems, An individual-based model of information diffusion combining friends' influence, Exploiting submodularity to quantify near-optimality in multi-agent coverage problems, Top-\(k\) overlapping densest subgraphs, A two-stage stochastic programming approach for influence maximization in social networks, Measuring the impact of MVC attack in large complex networks, Efficient minimization of higher order submodular functions using monotonic Boolean functions, Maximizing a submodular function with viability constraints, Near-linear time approximation schemes for geometric maximum coverage, Supermodular covering knapsack polytope, On maximizing a monotone \(k\)-submodular function subject to a matroid constraint, Polymatroids and mean-risk minimization in discrete optimization, New performance guarantees for the greedy maximization of submodular set functions, An approximation algorithm for a competitive facility location problem with network effects, Multi-level facility location problems, Item bidding for combinatorial public projects, Optimization with uniform size queries, Hooked on IP, The expressive power of binary submodular functions, Pseudo-Boolean optimization, Minimization of ordered, symmetric half-products, Maximizing a class of submodular utility functions, Video distribution under multiple constraints, Algorithms for storage allocation based on client preferences, Improved approximation algorithms for capacitated facility location problems, Optimally learning social networks with activations and suppressions, Implicit enumeration strategies for the hypervolume subset selection problem, An exact penalty function approach for nonlinear integer programming problems, Optimization of stochastic virus detection in contact networks, General asymptotic and submodular results for the Median problem with unreliable facilities, Risk averse submodular utility maximization, Assortment optimization over time, Performance bounds with curvature for batched greedy optimization, A constructive proof of swap local search worst-case instances for the maximum coverage problem, Differential approximation schemes for half-product related functions and their scheduling applications, Approximability issues for unconstrained and constrained maximization of half-product related functions, Robust monotone submodular function maximization, Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios, A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints, Maximization of submodular functions: theory and enumeration algorithms, Locating flow-capturing units on a network with multi-counting and diminishing returns to scale, Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, The submodular knapsack polytope, Robust placement of sensors in dynamic water distribution systems, Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem, Recent trends in combinatorial optimization, Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem, A heuristic lagrangean algorithm for the capacitated plant location problem, A comparison of two dual-based procedures for solving the p-median problem, A tree search algorithm for the multi-commodity location problem, Fixed points approach to clustering, Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions, Logical processing for integer programming, Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid, Siting renewable power generation assets with combinatorial optimisation, Provable randomized rounding for minimum-similarity diversification, Dual domination problems in graphs, Modeling the spread of infectious diseases through influence maximization, Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, A new greedy strategy for maximizing monotone submodular function under a cardinality constraint, On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks, Union acceptable profit maximization in social networks, Ranking with submodular functions on a budget, Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --, Two-stage stochastic max-weight independent set problems, Maximize the probability of union-influenced in social networks, Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice, Streaming submodular maximization under differential privacy noise, A multi-pass streaming algorithm for regularized submodular maximization, Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint, Fixed observation time-step: adaptive influence maximization, Measured continuous greedy with differential privacy, Result diversification by multi-objective evolutionary algorithms with theoretical guarantees, Maximizing a non-decreasing non-submodular function subject to various types of constraints, \(T \times\)\textit{one Hop} approach for dynamic influence maximization problem, Maximizing a monotone non-submodular function under a knapsack constraint, Parameterized approximations for the two-sided assortment optimization, Locating flow-intercepting facilities: New approaches and results, Fractional 0-1 programming and submodularity, Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Algorithms for covering multiple submodular constraints and applications, A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems, Gaussian downlink user selection subject to access limit, power budget, and rate demands, Election control through social influence with voters' uncertainty, Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms, Game theoretic resource allocation model for designing effective traffic safety solution against drunk driving, Quality of local equilibria in discrete exchange economies, Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees, Spider covers and their applications, Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint, The approximability of multiple facility location on directed networks with random arc failures, Target users' activation probability maximization with different seed set constraints in social networks, Submodular optimization problems and greedy strategies: a survey, Scalable influence maximization for independent cascade model in large-scale social networks, Online budgeted maximum coverage, On greedy heuristics for computing D-efficient saturated subsets, New solution approaches for the maximum-reliability stochastic network interdiction problem, Restricted strong convexity implies weak submodularity, A note on solving DiDi's driver-order matching problem, Rumor correction maximization problem in social networks, Measures minimizing regularized dispersion, An exact solution framework for the multiple gradual cover location problem, Parametric monotone function maximization with matroid constraints, Nonnegative definite Hermitian matrices with increasing principal minors, Election control through social influence with unknown preferences, Distributed resource allocation with binary decisions via Newton-like neural network dynamics, A model of anytime algorithm performance for bi-objective optimization, On strict submodularity of social influence, Non-monotone submodular function maximization under \(k\)-system constraint, Large-scale influence maximization via maximal covering location, Non-submodular streaming maximization with minimum memory and low adaptive complexity, Search complexity: a way for the quantitative analysis of the search space, Functional pearl: the distributive \(\lambda\)-calculus, Submodular unsplittable flow on trees, Real-time solving of computationally hard problems using optimal algorithm portfolios, Utilitarian welfare and representation guarantees of approval-based multiwinner rules, Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint, Generalized budgeted submodular set function maximization, Attribute based diversification of seeds for targeted influence maximization, Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations, A refined analysis of submodular greedy, Pareto optimization for subset selection with dynamic cost constraints, An exact cutting plane method for \(k\)-submodular function maximization, Heuristic methods and applications: A categorized survey, On the supermodular knapsack problem, Multi-pass streaming algorithms for monotone submodular function maximization, Adaptive influence maximization under fixed observation time-step, The simple plant location problem: Survey and synthesis, An analysis of the greedy algorithm for the submodular set covering problem, Permutatorial optimization via the permutahedron, Data source selection for approximate query, Fractionally subadditive maximization under an incremental knapsack constraint, Motif-role extraction in uncertain graph based on efficient ensembles, 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, The submodularity of two-stage stochastic maximum-weight independent set problems, An ascending implementation of the Vickrey-Clarke-Groves mechanism for the licensed shared access, Private non-monotone submodular maximization, Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy, Algorithms for influence maximization in socio-physical networks, An adaptive algorithm for maximization of non-submodular function with a matroid constraint, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, Submodular function minimization and polarity, Sequence independent lifting for a set of submodular maximization problems, Exploiting social influence to control elections based on positional scoring rules, Who should get vaccinated? Individualized allocation of vaccines over SIR network, Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization, Submodularity and local search approaches for maximum capture problems under generalized extreme value models, Optimal intervention in economic networks using influence maximization methods, Maximum coverage with cluster constraints: an LP-based approximation technique, An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint, General bounds for incremental maximization, Tight approximation bounds for maximum multi-coverage, Deals or No Deals: Contract Design for Online Advertising, Principal points analysis via p-median problem for binary data, A Canonical Representation of Simple Plant Location Problems and Its Applications, Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems, An Offline-Online Decomposition Method for Efficient Linear Bayesian Goal-Oriented Optimal Experimental Design: Application to Optimal Sensor Placement, Submodular Maximization Subject to a Knapsack Constraint Under Noise Models, Tight Approximation Bounds for Maximum Multi-coverage, Hardness Results for Seeding Complex Contagion with Neighborhoods, Controllability Metrics on Networks with Linear Decision Process--type Interactions and Multiplicative Noise, A Branch-and-Cut Algorithm for Submodular Interdiction Games, An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model, A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation, Approximation algorithms for maximum weight k-coverings of graphs by packings, Improving the Betweenness Centrality of a Node by Adding Links, Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models, Adaptive Test Allocation for Outbreak Detection and Tracking in Social Contact Networks, Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes, Multiobjective Tree-Structured Parzen Estimator, Submodular Functions: Learnability, Structure, and Optimization, Unnamed Item, Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order, Structured Robust Submodular Maximization: Offline and Online Algorithms, The Power of Subsampling in Submodular Maximization, Toward Robust Monitoring of Malicious Outbreaks, Maximizing set function formulation of two scheduling problems, Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint, Objective Selection for Cancer Treatment: An Inverse Optimization Approach, Beyond submodularity: a unified framework of randomized set selection with group fairness constraints, Capacity Games with Supply Function Competition, Optimizing Opinions with Stubborn Agents, Seeding with Costly Network Information, Constrained Submodular Maximization via a Nonsymmetric Technique, Submodular Maximization Through the Lens of Linear Programming, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Finite-Time Analysis for the Knowledge-Gradient Policy, Content and Structure Coverage: Extracting a Diverse Information Subset, Per-Round Knapsack-Constrained Linear Submodular Bandits, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization, A supermodular relaxation for scheduling with release dates, Unnamed Item, Navigating the protein fitness landscape with Gaussian processes, Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model, The multi-level uncapacitated facility location problem is not submodular, Unnamed Item, Unnamed Item, Approximating Robust Parameterized Submodular Function Maximization in Large-Scales, Unnamed Item, An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function., Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Efficient, optimal stochastic-action selection when limited by an action budget, Approximation for maximizing monotone non-decreasing set functions with a greedy method, Monotone submodular maximization over the bounded integer lattice with cardinality constraints, Parallelized maximization of nonsubmodular function subject to a cardinality constraint, Sequence submodular maximization meets streaming, Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint, Fast algorithms for maximizing monotone nonsubmodular functions, Fast algorithms for maximizing monotone nonsubmodular functions, Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint, Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, Parallelized maximization of nonsubmodular function subject to a cardinality constraint, A first hitting time approach to finding effective spreaders in a network, Novel algorithms for maximum DS decomposition, A fast double greedy algorithm for non-monotone DR-submodular function maximization, Two-stage submodular maximization under curvature, Discriminative frequent subgraph mining with optimality guarantees, Finding Submodularity Hidden in Symmetric Difference, Approximation Algorithms for Dynamic Assortment Optimization Models, Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences, Guess free maximization of submodular and linear sums, Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint, Online Submodular Maximization with Preemption, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances, A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints, Unnamed Item, The multi-level uncapacitated facility location problem is not submodular, Stability and Recovery for Independence Systems, Optimal experimental design for infinite-dimensional Bayesian inverse problems governed by PDEs: a review, On the Greedy Heuristic for Continuous Covering and Packing Problems, Unnamed Item, Unnamed Item, Improved algorithms for non-submodular function maximization problem, Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online, Algorithms for Persuasion with Limited Communication, An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint, Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice, The temporal aspects of the evidence-based influence maximization on social networks, Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint, A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms, Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics, Tight Approximation for Unconstrained XOS Maximization, Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model, Joint location and cost planning in maximum capture facility location under random utilities, A new perspective on low-rank optimization, Universal Algorithms for Clustering Problems, Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning, Online conflict resolution: algorithm design and analysis, A greedy Galerkin method to efficiently select sensors for linear dynamical systems, A survey on bilevel optimization under uncertainty, An exact method for influence maximization based on deterministic linear threshold model, A Fast and Scalable Computational Framework for Large-Scale High-Dimensional Bayesian Optimal Experimental Design, Justifying groups in multiwinner approval voting, Maximization of nonsubmodular functions under multiple constraints with applications, Distributed strategy selection: a submodular set function maximization approach, Two-stage non-submodular maximization, Robust maximum capture facility location under random utility maximization models, Two-stage BP maximization under \(p\)-matroid constraint, A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity, Opinion influence maximization problem in online social networks based on group polarization effect, Two-stage non-submodular maximization, Maximizing the influence with \(\kappa\)-grouping constraint, On maximizing sums of non-monotone submodular and linear functions, Improved deterministic algorithms for non-monotone submodular maximization, Unified Greedy Approximability beyond Submodular Maximization, Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity, Justifying groups in multiwinner approval voting, Constraint generation approaches for submodular function maximization leveraging graph properties, Efficient processing of \(k\)-regret minimization queries with theoretical guarantees, Improved deterministic algorithms for non-monotone submodular maximization, Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions, Supermodularity and valid inequalities for quadratic optimization with indicators, Streaming submodular maximization with the chance constraint, Unified greedy approximability beyond submodular maximization, Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint, The follower competitive facility location problem under the nested logit choice rule, Two generalizations of proper coloring: hardness and approximability, Two-stage BP maximization under \(p\)-matroid constraint, Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks, IM2Vec: representation learning-based preference maximization in geo-social networks, An exact solution approach for the mobile multi‐agent sensing problem, Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint, Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows, Submodularity and Randomized rounding techniques for Optimal Experimental Design, Strategyproof mechanisms for competitive influence in networks, Streaming Algorithms for Submodular Function Maximization, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems, Experimental Design for Nonparametric Correction of Misspecified Dynamical Models, The Expressive Power of Binary Submodular Functions, Structured Sparsity: Discrete and Convex Approaches, The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity, Idempotent Expansions for Continuous-Time Stochastic Control, Robust Monotone Submodular Function Maximization, Submodular Unsplittable Flow on Trees, Submodular Stochastic Probing on Matroids, Linear Time Approximation Schemes for Geometric Maximum Coverage, Combinatorial trace method for network immunization, Hub Location as the Minimization of a Supermodular Set Function, Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function, Complexity of constrained sensor placement problems for optimal observability, Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies, Stochastic-lazier-greedy algorithm for monotone non-submodular maximization, Centralized and decentralized rumor blocking problems, Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization, Influence analysis: A survey of the state-of-the-art, A mobile multi-agent sensing problem with submodular functions under a partition matroid, Exact hypervolume subset selection through incremental computations, Computing representations using hypervolume scalarizations, Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid, Hedonic expertise games, Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline, Submodular functions: from discrete to continuous domains, Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives, An optimal streaming algorithm for non-submodular functions maximization on the integer lattice, A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice, Submodular maximization over data streams with differential privacy noise, Analyzing Residual Random Greedy for monotone submodular maximization, Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences, Streaming submodular maximization under \(d\)-knapsack constraints, Improved bounds for the greedy strategy in optimization problems with curvature, Influence maximization with deactivation in social networks, Maximizing profit of multiple adoptions in social networks with a martingale approach, Optimizing node discovery on networks: problem definitions, fast algorithms, and observations, The multi-budget maximum weighted coverage problem, A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint, Interactive optimization of submodular functions under matroid constraints, Activity preserving graph simplification, Greedy guarantees for non-submodular function maximization under independent system constraint with applications, On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints, Recent Developments in Discrete Convex Analysis, A cutting-plane algorithm for solving a weighted influence interdiction problem, Practical budgeted submodular maximization, On the equivalence of optimal recommendation sets and myopically optimal query sets, Optimal approximability of bookmark assignments, Inequalities on submodular functions via term rewriting, Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time, Approximating the least core value and least core of cooperative games with supermodular costs, A neighbour scale fixed approach for influence maximization in social networks, Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint, The maximum vertex coverage problem on bipartite graphs, Matching influence maximization in social networks, Influence maximization in the presence of vulnerable nodes: a ratio perspective, Maximize a monotone function with a generic submodularity ratio, Approximating max-min weighted \(T\)-joins, An efficient linear programming based method for the influence maximization problem in social networks, A Review for Submodular Optimization on Machine Scheduling Problems, Spreading dynamics in complex networks, Optimizing spread dynamics on graphs by message passing, Deterministic approximation algorithm for submodular maximization subject to a matroid constraint, Minimizing the Spread of Rumor Within Budget Constraint in Online Network, A unifying look at sequence submodularity, Capacitated strategic assortment planning under explicit demand substitution, Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences, Solving the uncapacitated facility location problem using tabu search, Disjoint bases in a polymatroid, A PTAS for the minimization of polynomials of fixed degree over the simplex, Finding top-\(k\) influential users in social networks under the structural diversity model, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, General rumor blocking: an efficient random algorithm with martingale approach, Community based acceptance probability maximization for target users on social networks: algorithms and analysis, Sparsity in max-plus algebra and systems, Approximation algorithms for the connected sensor cover problem, Limitations of randomized mechanisms for combinatorial auctions, I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs, Constrained submodular maximization via greedy local search, Approximation algorithms for connected maximum cut and related problems, ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS, Approximation Algorithms for D-optimal Design, Non-submodular maximization on massive data streams, Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer, Maximizing Influence in Competitive Environments: A Game-Theoretic Approach, Set function optimization, Item Pricing for Combinatorial Public Projects, Complete submodularity characterization in the comparative independent cascade model, Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, Minimizing ratio of monotone non-submodular functions, A Probabilistic Analysis of the K-Location Problem, Informative path planning as a maximum traveling salesman problem with submodular rewards, A tight analysis of the submodular-supermodular procedure, Unnamed Item, Roof duality, complementation and persistency in quadratic 0–1 optimization
Cites Work
