Pages that link to "Item:Q5091208"

The following pages link to A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208):

Displaying 14 items.

• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• A refined analysis of submodular greedy (Q2060587) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465) (← links)
• A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
• On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
• Practical budgeted submodular maximization (Q2701388) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
• Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
• Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)