The following pages link to (Q3549686):
Displaying 44 items.
- Budget Feasible Procurement Auctions (Q4971366) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- (Q5009516) (← links)
- (Q5009517) (← links)
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
- (Q5053276) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5075815) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- (Q5090369) (← links)
- (Q5090397) (← links)
- (Q5091209) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- On the Nisan-Ronen conjecture for submodular valuations (Q5144994) (← links)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- (Q5874477) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5918257) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
- Efficient, optimal stochastic-action selection when limited by an action budget (Q5962147) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- The Frank-Wolfe algorithm: a short introduction (Q6118086) (← links)
- On Fair Division under Heterogeneous Matroid Constraints (Q6135949) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Stochastic Variance Reduction for DR-Submodular Maximization (Q6492081) (← links)
- Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)
- Regularized nonmonotone submodular maximization (Q6548318) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization (Q6646409) (← links)
