scientific article; zbMATH DE number 7378635
From MaRDI portal
Publication:5009516
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.23MaRDI QIDQ5009516
F. Bruce Shepherd, Richard Santiago
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.03767
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
The multi-budget maximum weighted coverage problem ⋮ New approximations and hardness results for submodular partitioning problems
Cites Work
- Inapproximability results for combinatorial auctions with submodular utility functions
- Geometric algorithms and combinatorial optimization.
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Minimizing submodular functions over families of sets
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- On the complexity of approximating \(k\)-set packing
- Combinatorial auctions with decreasing marginal utilities
- Symmetry and Approximability of Submodular Maximization Problems
- Maximizing Non-monotone Submodular Functions
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Tight approximation algorithms for maximum general assignment problems
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Submodular Function Minimization under Covering Constraints
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
- Non-monotone submodular maximization under matroid and knapsack constraints
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Facility location with hierarchical facility costs
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
