scientific article; zbMATH DE number 3635849
From MaRDI portal
Publication:4196269
Cited in
(only showing first 100 items - show all)- A note on submodular set cover on matroids
- Directed submodularity, ditroids and directed submodular flows
- Matroid matching and some applications
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- A constructive proof of swap local search worst-case instances for the maximum coverage problem
- The simple plant location problem: Survey and synthesis
- Online budgeted maximum coverage
- Parametric monotone function maximization with matroid constraints
- Non-monotone submodular function maximization under k-system constraint
- Multi-pass streaming algorithms for monotone submodular function maximization
- Who should get vaccinated? Individualized allocation of vaccines over SIR network
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- A multi-pass streaming algorithm for regularized submodular maximization
- Policies for risk-aware sensor data collection by mobile agents
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Fractional 0-1 programming and submodularity
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- Quality of local equilibria in discrete exchange economies
- Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees
- Submodular optimization problems and greedy strategies: a survey
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
- Maximize a monotone function with a generic submodularity ratio
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
- Constrained submodular maximization via greedy local search
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Set function optimization
- On a class of covering problems with variable capacities in wireless networks
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- Optimization with demand oracles
- Improved bounds for the greedy strategy in optimization problems with curvature
- Inequalities on submodular functions via term rewriting
- Approximating max-min weighted \(T\)-joins
- A \(k\)-product uncapacitated facility location problem
- Combinatorial auctions with decreasing marginal utilities
- A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
- A mobile multi-agent sensing problem with submodular functions under a partition matroid
- Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Interactive optimization of submodular functions under matroid constraints
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint
- The simulated greedy algorithm for several submodular matroid secretary problems
- Recent developments in discrete convex analysis
- Buyback problem -- approximate matroid intersection with cancellation costs
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- Streaming algorithms for submodular function maximization
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Thresholded covering algorithms for robust and max-min optimization
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Online submodular welfare maximization: greedy beats 1/2 in random order
- The submodular secretary problem goes linear
- Is submodularity testable?
- Valuated matroid-based algorithm for submodular welfare problem
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- When are welfare guarantees robust?
- Multi-agent submodular optimization
- Non-submodular maximization with matroid and knapsack constraints
- Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- The power of subsampling in submodular maximization
- A Framework for the Secretary Problem on the Intersection of Matroids
- Capturing complementarity in set functions by going beyond submodularity/subadditivity
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
- Constrained submodular maximization via a nonsymmetric technique
- Submodular Maximization Through the Lens of Linear Programming
- Stability and recovery for independence systems
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- New performance guarantees for the greedy maximization of submodular set functions
- IP over 40+ years at IBM scientific centers and marketing
- Video distribution under multiple constraints
- Submodular functions are noise stable
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- The Limitations of Optimization from Samples
- Robust independence systems
- Approximate multi-matroid intersection via iterative refinement
- Novel algorithms for maximum DS decomposition
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Two-stage submodular maximization under curvature
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Improved algorithms for non-submodular function maximization problem
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Selecting energy efficient inputs using graph structure
- Maximization of nonsubmodular functions under multiple constraints with applications
- Distributed strategy selection: a submodular set function maximization approach
- 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
- Improved deterministic algorithms for non-monotone submodular maximization
- Unified Greedy Approximability beyond Submodular Maximization
- Streaming submodular maximization with the chance constraint
- Unified greedy approximability beyond submodular maximization
- Improved deterministic algorithms for non-monotone submodular maximization
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- An exact solution approach for the mobile multi‐agent sensing problem
- Two-stage BP maximization under p-matroid constraint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4196269)
