Optimal weight allocation in rooted trees

DOI10.1007/S10878-014-9807-0MaRDI QIDQ266022zbMATH OpenOpenAlexFDO

Authors Shmuel Wimer

Publication date 13 April 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-014-9807-0

zbMATH Keywords

amplifier-treebinary tree optimizationclock-treeweight allocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Resource allocation in rooted trees for VLSI applications
• Optimal layout of edge-weighted forests
• Alphabetic Minimax Trees
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• An Optimal Algorithm for Weighted Minimax Flow Centers on Trees

Cited in

(7)

• Optimal layout of edge-weighted forests
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• scientific article; zbMATH DE number 4216785 (Why is no real title available?)
• Weighted Leaf AVL-Trees
• Weighted Rooted Trees: Fat or Tall?
• Total Weight Choosability of Trees
• Resource allocation in rooted trees for VLSI applications

This page was built for publication: Optimal weight allocation in rooted trees

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