Coupled and k-sided placements: generalizing generalized assignment

DOI10.1007/S10107-015-0930-1MaRDI QIDQ896299zbMATHOpenAlexFDO

Authors Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku

Publication date 9 December 2015

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-015-0930-1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Coupled and k-Sided Placements: Generalizing Generalized Assignment
• Distributed approximation of \(k\)-service assignment
• scientific article; zbMATH DE number 1445307
• Colocating tasks in data centers using a side-effects performance model
• APPLICATION PLACEMENT ON A CLUSTER OF SERVERS

Cites work

• scientific article; zbMATH DE number 1445306 (Why is no real title available?)
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for scheduling unrelated parallel machines
• Constraint satisfaction, packet routing, and the lovasz local lemma
• Convex programming for scheduling unrelated parallel machines
• How to sell hyperedges: the hypermatching assignment problem
• Iterative methods in combinatorial optimization.
• On \(k\)-column sparse packing programs
• On the complexity of approximating \(k\)-set packing
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• The Moser--Tardos Framework with Partial Resampling
• Tight approximation algorithms for maximum general assignment problems

Cited in

(7)

• Distributed approximation of \(k\)-service assignment
• Coupled and k-Sided Placements: Generalizing Generalized Assignment
• Core group placement: allocation and provisioning of heterogeneous resources
• Reallocation problems with minimum completion time
• Distributed approximation of \(k\)-service assignment
• Colocating tasks in data centers using a side-effects performance model
• Robustly assigning unstable items

This page was built for publication: Coupled and \(k\)-sided placements: generalizing generalized assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896299)