Pages that link to "Item:Q5169688"

The following pages link to Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688):

Displaying 37 items.

• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
• New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
• Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
• The knapsack problem with neighbour constraints (Q1932367) (← links)
• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
• Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
• Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
• Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• Optimization with demand oracles (Q2414860) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
• A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
• The multi-budget maximum weighted coverage problem (Q2692723) (← links)
• Practical budgeted submodular maximization (Q2701388) (← links)
• (Q2958605) (← links)
• Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
• Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
• Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
• Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
• A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
• Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
• Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
• Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
• Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
• Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
• Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
• A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
• Two-stage submodular maximization problem beyond nonnegative and monotone (Q6620015) (← links)
• Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems (Q6633554) (← links)