scientific article; zbMATH DE number 7051222
From MaRDI portal
Publication:4633864
Recommendations
- Submodular functions: optimization and approximation
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
- On submodular function minimization
- Submodular function minimization and related topics
- Towards minimizing k-submodular functions
- Submodular functions and optimization
- Submodular function minimization
- Submodular function minimization
- The boundaries of submodular functions
- Submodular maximization with nearly optimal approximation, adaptivity and query complexity
Cited in
(33)- Gross substitutability: an algorithmic survey
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- New approximations and hardness results for submodular partitioning problems
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- On additive approximate submodularity
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Algorithms and lower bounds for submodular cuts and approximating submodular functions
- Submodular functions: optimization and approximation
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Submodular functions: learnability, structure, and optimization
- Is submodularity testable?
- Faster and simpler sketches of valuation functions
- Approximate modularity revisited
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Approximate modularity revisited
- Finding submodularity hidden in symmetric difference
- Optimization with uniform size queries
- Sketching valuation functions
- scientific article; zbMATH DE number 7651150 (Why is no real title available?)
- Approximate F₂-Sketching of Valuation Functions
- The Limitations of Optimization from Samples
- Tractability of explaining classifier decisions
- Online dynamic submodular optimization
- Cut sparsification and succinct representation of submodular hypergraphs
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Shortest cycles with monotone submodular costs
- Submodular combinatorial information measures with applications in machine learning
- The submodular Santa Claus problem in the restricted assignment case
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Universal optimization for non-clairvoyant subadditive joint replenishment
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 Q4633864)
