Flexible allocation on related machines with assignment restrictions
type: Item
instance of: scholarly article
title: Flexible allocation on related machines with assignment restrictions
zbMATH Open document ID: 1401.90081
author: Dror Rawitz
author: Ariella Voloshin
published in: Discrete Applied Mathematics
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6966420
zbMATH Keywords: approximation algorithms
zbMATH Keywords: flexible resource allocation
zbMATH Keywords: local ratio
zbMATH Keywords: LP rounding
MaRDI profile type: Publication
full work available at URL: j.dam.2018.05.004
OpenAlex ID: W2806826029
cites work: Q3056948
cites work: A unified approach to approximating resource allocation and scheduling
cites work: Q3337223
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: An efficient approximation for the generalized assignment problem
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: Tight approximation algorithms for maximum general assignment problems
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: On the complexity of approximating \(k\)-set packing
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Distributed approximation of cellular coverage
cites work: Flexible Bandwidth Assignment with Application to Optical Networks
cites work: Profit Maximization in Flex-Grid All-Optical Networks
cites work: An approximation algorithm for the generalized assignment problem
DOI: 10.1016/J.DAM.2018.05.004
description: scientific article; zbMATH DE number 6966420