Pages that link to "Item:Q3581502"
From MaRDI portal
The following pages link to Tight approximation algorithms for maximum general assignment problems (Q3581502):
Displayed 30 items.
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- The generalized maximum coverage problem (Q963466) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- On fractional cut covers (Q2312658) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Task assignment in tree-like hierarchical structures (Q2410113) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- (Q5009516) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Truthful Generalized Assignments via Stable Matching (Q5244865) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Robustly assigning unstable items (Q5918516) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Budget-constrained cost-covering job assignment for a total contribution-maximizing platform (Q6182924) (← links)