A Constant Factor Approximation Algorithm for the Storage Allocation Problem

We study the storage allocation problem ( SAP ) which is a variant of the unsplittable flow problem on paths ( UFPP ). A SAP instance consists of a path P = ( V , E ) and a set J of tasks. Each edge e ∈ E has a capacity c e and each task j ∈ J is associated with a path I j in P , a demand d j and a...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 77; no. 4; pp. 1105 - 1127
Main Authors:	Bar-Yehuda, Reuven, Beder, Michael, Rawitz, Dror
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2017 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Polynomials Theory of Computation Approximation algorithms Bandwidth allocation Rectangle packing Storage allocation Unsplittable flow
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!