Coupled and \(k\)-sided placements: generalizing generalized assignment
type: Item
instance of: scholarly article
title: Coupled and \(k\)-sided placements: generalizing generalized assignment
zbMATH Open document ID: 1333.90071
author: Madhukar R. Korupolu
author: Adam Meyerson
author: Rajmohan Rajaraman
author: Brian Tagiku
published in: Mathematical Programming. Series A. Series B
publication date: 2015-12-09T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6518245
MaRDI profile type: Publication
full work available at URL: s10107-015-0930-1
OpenAlex ID: W2179076272
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: On the complexity of approximating \(k\)-set packing
cites work: Convex programming for scheduling unrelated parallel machines
cites work: On k-Column Sparse Packing Programs
cites work: The Design of Competitive Online Algorithms via a Primal—Dual Approach
cites work: Q4952619
cites work: How to Sell Hyperedges: The Hypermatching Assignment Problem
cites work: Tight approximation algorithms for maximum general assignment problems
cites work: The Moser--Tardos Framework with Partial Resampling
cites work: Constraint satisfaction, packet routing, and the lovasz local lemma
cites work: Iterative Methods in Combinatorial Optimization
cites work: An approximation algorithm for the generalized assignment problem
DOI: 10.1007/S10107-015-0930-1
description: scientific article; zbMATH DE number 6518245