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

DOI10.1016/j.ipl.2021.106114OpenAlexW3140098681MaRDI QIDQ2032152

Shmuel Wimer, Nir Halman

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106114

zbMATH Keywords

dynamic programmingresource allocationdesign of algorithmsFPTAS\(K\)-approximation sets and functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Optimal weight allocation in rooted trees
• A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
• Data-Dependent Delays as a Barrier Against Power Attacks
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
• Resource allocation in rooted trees for VLSI applications
• Unnamed Item

This page was built for publication: Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions