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

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!