Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
type: Item
instance of: scholarly article
title: Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
author: Nir Halman
author: Shmuel Wimer
published in: Information Processing Letters
publication date: 2021-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7360075
zbMATH Keywords: resource allocation
zbMATH Keywords: dynamic programming
zbMATH Keywords: \(K\)-approximation sets and functions
zbMATH Keywords: FPTAS
zbMATH Keywords: design of algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106114
OpenAlex ID: W3140098681
cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
cites work: Data-Dependent Delays as a Barrier Against Power Attacks
cites work: Q4474178
cites work: Optimal weight allocation in rooted trees
cites work: Resource allocation in rooted trees for VLSI applications
DOI: 10.1016/J.IPL.2021.106114
Recommended article: Resource allocation in bounded degree trees
Recommended article: Resource Allocation in Bounded Degree Trees
Recommended article: A network flow approach to cost allocation for rooted trees
Recommended article: Minimax Resource Allocation with Tree Structured Substitutable Resources
Recommended article: Discrete resource allocation with tree constraints by an incremental method
Recommended article: Optimal weight allocation in rooted trees
Recommended article: Q3991721
Recommended article: The Nonlinear Resource Allocation Problem
Recommended article: Dynamic and static algorithms for optimal placement of resources in a tree
Recommended article: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
description: scientific article; zbMATH DE number 7360075