Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions

•We study resource allocation problems in rooted trees in which demand values are given in the leaves.•Single-type resources (weights) are to be assigned in the tree nodes such that the total weight in the rooted path from each leaf to the root equals its demand.•The goal is to minimize the total co...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 170; p. 106114
Main Authors:	Halman, Nir, Wimer, Shmuel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2021
Subjects:	Design of algorithms Dynamic programming FPTAS K-approximation sets and functions Resource allocation K-approximation sets and functions Dynamic programming Design of algorithms FPTAS Resource allocation
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	•We study resource allocation problems in rooted trees in which demand values are given in the leaves.•Single-type resources (weights) are to be assigned in the tree nodes such that the total weight in the rooted path from each leaf to the root equals its demand.•The goal is to minimize the total costs of the allocated resources.•It is known that when the cost of a resource is linearly proportional to its weight, the problem is solvable in linear time.•We show that when costs are arbitrary monotone nondecreasing functions, the problem becomes intractable, and design for it a fully polynomial time approximation scheme. We study resource allocation problems in rooted trees in which demand values are given in the leaves. Single-type resources (weights) are to be assigned in the tree nodes such that the total weight in the rooted path from each leaf to the root equals its demand. The goal is to minimize the total costs of the allocated resources. It is known that the linear cost case, i.e., when the cost of a resource is proportional to its weight, is solvable in linear time. In this paper we show that when costs are monotone nondecreasing functions, which reflect, e.g., (dis)economies of scale, the problem becomes intractable, and design for it a fully polynomial time approximation scheme by formulating it as a dynamic program and using the technique of K-approximation sets and functions.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/j.ipl.2021.106114