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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 170; S. 106114
Hauptverfasser:	Halman, Nir, Wimer, Shmuel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2021
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!