Robustly assigning unstable items

DOI10.1007/s10878-019-00515-wzbMath1502.90144OpenAlexW4240487977WikidataQ126404211 ScholiaQ126404211MaRDI QIDQ5918516

Nicholas Jaczko, Scott Westvold, Christine Chung, David S. Yuen, Ananya D. Christman

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00515-w

zbMATH Keywords

robustcombinatorial optimizationapproximation algorithmdistributed systemassignmentbin packinghosting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for time constrained scheduling
• Coupled and \(k\)-sided placements: generalizing generalized assignment
• An approximation algorithm for the generalized assignment problem
• An approximation scheme for bin packing with conflicts
• Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
• APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
• Tight approximation algorithms for maximum general assignment problems
• On Bin Packing with Conflicts

This page was built for publication: Robustly assigning unstable items