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

Celý popis

Podrobná bibliografie

Vydáno v:	Information processing letters Ročník 170; s. 106114
Hlavní autoři:	Halman, Nir, Wimer, Shmuel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2021
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!