Tight approximation algorithms for maximum separable assignment problems
From MaRDI portal
Recommendations
- Approximation algorithms for the partial assignment problem
- Approximation Algorithms for the Max-Min Allocation Problem
- Tight Approximation Bounds for the Seminar Assignment Problem
- An efficient approximation for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
- Approximation algorithms for maximization problems arising in graph partitioning
Cited in
(41)- Online interval scheduling with a bounded number of failures
- Distributed approximation of k-service assignment
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- On the approximability of the two-phase knapsack problem
- A polynomial-time approximation scheme for the airplane refueling problem
- Packing items into several bins facilitates approximating the separable assignment problem
- Approximating the least core value and least core of cooperative games with supermodular costs
- Critical edges for the assignment problem: complexity and exact resolution
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
- Approximability of scheduling problems with resource consuming jobs
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Approximation algorithms for the generalized incremental knapsack problem
- Approximability of two variants of multiple knapsack problems
- Tight Approximation Bounds for the Seminar Assignment Problem
- Maximum generalized assignment with convex costs
- All-or-nothing generalized assignment with application to scheduling advertising campaigns
- All-or-nothing generalized assignment with application to scheduling advertising campaigns
- Generalized assignment of time-sensitive item groups
- Generalized assignment via submodular optimization with reserved capacity
- Technical note -- The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays
- Improved approximation algorithms for box contact representations
- Truthful mechanism design via correlated tree rounding
- How to sell hyperedges: the hypermatching assignment problem
- The complexity of contracts
- Resource time-sharing for IoT applications with deadlines
- Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
- Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- The preemptive resource allocation problem
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
- Improved approximation for two-dimensional vector multiple knapsack
- Time-sharing scheduling with tolerance capacities
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- The average-value allocation problem
- Improved approximation for two-dimensional vector multiple knapsack
- Approximation algorithms for maximum weighted throughput on unrelated machines
- An exact solver for submodular knapsack problems
- A unified model of congestion games with priorities: two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
- Improved approximation algorithms for three-dimensional bin packing
- The transportation problem with conflicts
- Some properties of the alternating separation (AS) and ASAP algorithm
This page was built for publication: Tight approximation algorithms for maximum separable assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884281)
