The following pages link to (Q5365101):
Displaying 32 items.
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Budgeted colored matching problems (Q1742233) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Randomized rounding in the presence of a cardinality constraint (Q2828177) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Generalized center problems with outliers (Q5002700) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← links)
- Congestion minimization for multipath routing via multiroute flows (Q5240417) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- (Q5743405) (← links)
- (Q5743409) (← links)
- (Q5743495) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- An FPTAS for budgeted laminar matroid independent set (Q6556192) (← links)
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs (Q6657247) (← links)
