Flexible allocation on related machines with assignment restrictions
DOI10.1016/J.DAM.2018.05.004zbMATH Open1401.90081OpenAlexW2806826029MaRDI QIDQ1801074FDOQ1801074
Authors: Dror Rawitz, Ariella Voloshin 
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.004
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Network flows. Theory, algorithms, and applications.
- An approximation algorithm for the generalized assignment problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- An efficient approximation for the generalized assignment problem
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On the complexity of approximating \(k\)-set packing
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- Tight approximation algorithms for maximum general assignment problems
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Distributed approximation of cellular coverage
- Flexible Bandwidth Assignment with Application to Optical Networks
- Profit maximization in flex-grid all-optical networks
Cited In (3)
This page was built for publication: Flexible allocation on related machines with assignment restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801074)
