N. Katoh. Parametric combinatorial optimization problems and applications. J. Inst. Electronics, Information and Communication Engineers, 74 (1991), 949--956.  Home/Search   Document Not in Database   Summary   Related Articles

....Henzinger home.html; monika pa.dec.com. #, the minimum spanning tree itself changes. The two central questions related to this problem are: how many different trees does G have as # varies from # to #, and how can one compute this sequence of trees As Katoh [23, 24] has described, parametric minimum spanning trees can be used to solve many other problems in combinatorial optimization, in which one seeks to find a tree T minimizing a function of the form f (X, Y ) where f is quasiconcave and X = P e#T x e and Y = P e#T y e . For example, the problem of ....

N. Katoh. Parametric combinatorial optimization problems and applications. J. Inst. Electronics, Information and Communication Engineers, 74 (1991), 949--956.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC