The approximability of three-dimensional assignment problems with bottleneck objective
type: Item
instance of: scholarly article
title: The approximability of three-dimensional assignment problems with bottleneck objective
zbMATH Open document ID: 1180.90167
author: S. Polyakovskiy
author: Frits C. R. Spieksma
author: Gerhard J. Woeginger
author: Dries R. Goossens
published in: Optimization Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5664368
zbMATH Keywords: bottleneck problem
zbMATH Keywords: multidimensional assignment
zbMATH Keywords: approximation
zbMATH Keywords: computational complexity
zbMATH Keywords: efficient algorithm
MaRDI profile type: Publication
full work available at URL: s11590-009-0152-7
OpenAlex ID: W2153180732
cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities
cites work: Q3154375
cites work: Planar 3DM is NP-complete
cites work: Clustering to minimize the maximum intercluster distance
cites work: The three dimensional bottleneck assignment problem and its variants
cites work: Approximation algorithms for multi-index transportation problems with decomposable costs
cites work: Geometric three-dimensional assignment problems
cites work: Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
cites work: Approximations for a bottleneck Steiner tree problem
DOI: 10.1007/S11590-009-0152-7
description: scientific article; zbMATH DE number 5664368