Resource allocation in rooted trees for VLSI applications

DOI10.1080/02331934.2019.1576669MaRDI QIDQ5384608zbMATH OpenOpenAlexFDO

Authors 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

analog-to-digital convertercircuit securitydelay distributiondynamic programminginverse 1-medianresource allocation

Mathematics Subject Classification ID

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

Recommendations

• Optimal weight allocation in rooted trees
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• Optimal layout of edge-weighted forests
• Optimal placement of identical resources in a tree
• Dynamic and static algorithms for optimal placement of resources in a tree

Cites work

• A simple linear time algorithm for computing a 1-median on cactus graphs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Data-Dependent Delays as a Barrier Against Power Attacks
• scientific article; zbMATH DE number 2081069 (Why is no real title available?)
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse median problems
• Optimal weight allocation in rooted trees

Cited in

(5)

• Resource allocation in bounded degree trees
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• The minmax regret inverse maximum weight problem
• Optimal weight allocation in rooted trees
• Robust reverse 1-center problems on trees with interval costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384608)