scientific article
From MaRDI portal
Publication:3549686
zbMath1231.91094MaRDI QIDQ3549686
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (90)
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models ⋮ Single-Parameter Combinatorial Auctions with Partially Public Valuations ⋮ Natural graph wavelet packet dictionaries ⋮ An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model ⋮ Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- ⋮ Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice ⋮ Measured continuous greedy with differential privacy ⋮ Policies for risk-aware sensor data collection by mobile agents ⋮ Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Algorithms for covering multiple submodular constraints and applications ⋮ Unnamed Item ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Structured Robust Submodular Maximization: Offline and Online Algorithms ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ A mobile multi-agent sensing problem with submodular functions under a partition matroid ⋮ Near-Optimal Asymmetric Binary Matrix Partitions ⋮ Optimization with demand oracles ⋮ Submodular functions: from discrete to continuous domains ⋮ An accelerated continuous greedy algorithm for maximizing strong submodular functions ⋮ Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint ⋮ Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms ⋮ Distributed strategy selection: a submodular set function maximization approach ⋮ Submodular Maximization Through the Lens of Linear Programming ⋮ The Frank-Wolfe algorithm: a short introduction ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ Energy efficient monitoring in sensor networks ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Unnamed Item ⋮ Approximation algorithms for the partial assignment problem ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ Unified greedy approximability beyond submodular maximization ⋮ Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise ⋮ Profit maximization for multiple products in community-based social networks ⋮ Near-optimal asymmetric binary matrix partitions ⋮ The multi-budget maximum weighted coverage problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ Greedy guarantees for non-submodular function maximization under independent system constraint with applications ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Santa Claus Meets Hypergraph Matchings ⋮ Submodular Optimization with Contention Resolution Extensions. ⋮ A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem ⋮ Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization ⋮ A framework of discrete DC programming by discrete convex analysis ⋮ Deterministic approximation algorithm for submodular maximization subject to a matroid constraint ⋮ Unnamed Item ⋮ A note on solving DiDi's driver-order matching problem ⋮ Truthful mechanism design via correlated tree rounding ⋮ Maximizing a class of submodular utility functions ⋮ Parametric monotone function maximization with matroid constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-monotone submodular function maximization under \(k\)-system constraint ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Economic efficiency requires interaction ⋮ Welfare maximization with production costs: a primal dual approach ⋮ Efficient, optimal stochastic-action selection when limited by an action budget ⋮ Approximation for maximizing monotone non-decreasing set functions with a greedy method ⋮ Non-submodular streaming maximization with minimum memory and low adaptive complexity ⋮ Limitations of randomized mechanisms for combinatorial auctions ⋮ Parallelized maximization of nonsubmodular function subject to a cardinality constraint ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Robust monotone submodular function maximization ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Constrained submodular maximization via greedy local search ⋮ Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint ⋮ Parallelized maximization of nonsubmodular function subject to a cardinality constraint ⋮ \(\ell_1\)-sparsity approximation bounds for packing integer programs ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas ⋮ Budget Feasible Procurement Auctions ⋮ Black-Box Reductions in Mechanism Design ⋮ Unnamed Item ⋮ An almost optimal approximation algorithm for monotone submodular multiple knapsack ⋮ Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders ⋮ Stability and Recovery for Independence Systems ⋮ Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice ⋮ Private non-monotone submodular maximization ⋮ On a class of covering problems with variable capacities in wireless networks ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings ⋮ Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
This page was built for publication:
