dynamic programming on a tree

I have a binary tree. So there is a unique path from root to each
leaf in the tree.
Each leaf L also has a number associated with it, A(L). In addition
user inputs an interval [a,b].


Now, I have to assign weights w_i (positive reals) to all nodes
including leafs such that product of weights from root to a leaf j
equals A(j).


But, I want to assign weights such that the total number of weights
that are outside a specified interval [a,b] is minimized. That means,
I want to keep the values of the weights in that interval.


I want to formulate a dynamic programming. Any ideas ? Is it possible
to have a dynamic program for this problem ?

.

Relevant Pages

  • Re: dynamic programming on a tree
    ... > Each leaf L also has a number associated with it, ... > including leafs such that product of weights from root to a leaf j equals ... Start with 0 OOI weights at the root. ...
    (comp.theory)
  • Re: Index tree
    ... But why it also affect the depth of the tree? ... The leaf pages store both the indexed values and the corresponding values ... The root page will have the indexed values of the first row on ...
    (microsoft.public.sqlserver.server)
  • Re: Strange runtime error: AbstractMethodError
    ... public Root someMethod; ... class Leaf implements Intermediary { ... public Leaf someMethod() { ... Intermediary.java:2: someMethod() in Intermediary clashes with someMethod ...
    (comp.lang.java.programmer)
  • Re: Looking for specific plant
    ... the leaf in a glass of water until roots started. ... through Google on scoring the fleshy part of the leaf to start root ... specimen size plant. ... itt suggest leaving the plant in water to promote root growth. ...
    (rec.gardens)
  • Re: Why are very large trees tall?
    ... mechanism for xylem rise, not root pressure. ... I'm still hoping for a reference that describes how the xylem ... transforms into the leaf structure. ... the water moves from the xylem inside the veins through the ...
    (talk.origins)