Tight approximation algorithms for maximum general assignment problems
From MaRDI portal
Cited in
(36)- The generalized maximum coverage problem
- Distributed approximation of k-service assignment
- Constrained submodular maximization via a nonsymmetric technique
- Multi-agent submodular optimization
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- An efficient approximation for the generalized assignment problem
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Multiple subset sum with inclusive assignment set restrictions
- On a class of covering problems with variable capacities in wireless networks
- Truthful generalized assignments via stable matching
- Performance bounds with curvature for batched greedy optimization
- Budget-constrained cost-covering job assignment for a total contribution-maximizing platform
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- Tight Approximation Bounds for the Seminar Assignment Problem
- On the approximability of robust network design
- On Lagrangian Relaxation and Subset Selection Problems
- Algorithmic contract theory: a survey
- A Survey of the Generalized Assignment Problem and Its Applications
- Two stage decision making approach for sensor mission assignment problem
- An exact solver for submodular knapsack problems
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Coupled and \(k\)-sided placements: generalizing generalized assignment
- Robustly assigning unstable items
- Local search algorithms for the red-blue median problem
- Flexible allocation on related machines with assignment restrictions
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- A priority based unbalanced time minimization assignment problem
- Convergence and approximation in potential games
- Submodular optimization problems and greedy strategies: a survey
- Valuated matroid-based algorithm for submodular welfare problem
- Task assignment in tree-like hierarchical structures
- The price of fairness for budget-feasible EF1 allocations
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- Online submodular maximization with preemption
- On fractional cut covers
- Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles
This page was built for publication: Tight approximation algorithms for maximum general assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581502)
