scientific article; zbMATH DE number 7525506
From MaRDI portal
Publication:5075815
DOI10.4230/LIPIcs.ESA.2019.69MaRDI QIDQ5075815
Kanthi K. Sarpatwar, Ariel Kulik, Baruch Schieber, Hadas Shachnai
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.01745
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsknapsack constraintssubmodular maximizationgroup generalized assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the generalized assignment problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Packing items into several bins facilitates approximating the separable assignment problem
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- Tight Approximation Bounds for the Seminar Assignment Problem
- Iterative Methods in Combinatorial Optimization
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Deterministic Algorithms for Submodular Maximization Problems
- Deterministic Algorithms for Submodular Maximization Problems
- All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A Unified Continuous Greedy Algorithm for Submodular Maximization
This page was built for publication:
