Robustly assigning unstable items

Ananya Christman (), Christine Chung (), Nicholas Jaczko (), Scott Westvold () and David S. Yuen ()
Additional contact information
Ananya Christman: Middlebury College
Christine Chung: Connecticut College
Nicholas Jaczko: Middlebury College
Scott Westvold: Middlebury College
David S. Yuen: University of Hawaii

Journal of Combinatorial Optimization, No 0, 22 pages

Abstract: Abstract We study the robust assignment problem where the goal is to assign items of various types to containers without exceeding container capacity. We seek an assignment that uses the fewest number of containers and is robust, that is, if any item of type $$t_i$$ti becomes corrupt causing the containers with type $$t_i$$ti to become unstable, every other item type $$t_j \ne t_i$$tj≠ti is still assigned to a stable container. We begin by presenting an optimal polynomial-time algorithm that finds a robust assignment using the minimum number of containers for the case when the containers have infinite capacity. Then we consider the case where all containers have some fixed capacity and give an optimal polynomial-time algorithm for the special case where each type of item has the same size. When the sizes of the item types are nonuniform, we provide a polynomial-time 2-approximation for the problem. We also prove that the approximation ratio of our algorithm is no lower than 1.813. We conclude with an experimental evaluation of our algorithm.

Keywords: Approximation algorithm; Robust; Assignment; Hosting; Distributed system; Combinatorial optimization; Bin packing (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00515-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00515-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00515-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().