Resource allocation in rooted trees for VLSI applications

DOI10.1080/02331934.2019.1576669zbMath1415.90110OpenAlexW2912379799MaRDI QIDQ5384608

Uri Wimer, Shmuel Wimer

Publication date: 24 June 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1576669

zbMATH Keywords

dynamic programmingresource allocationdelay distributionanalog-to-digital converterinverse 1-mediancircuit security

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (2)

The minmax regret inverse maximum weight problem ⋮ Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal weight allocation in rooted trees
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Data-Dependent Delays as a Barrier Against Power Attacks

This page was built for publication: Resource allocation in rooted trees for VLSI applications