A set F that consists of a k independent vertex to a tree T is required to minimize the value of the cost (F) = min w (x) *d (x, U). Similar to the K median problem of the directed tree, it transforms the directed tree into an equivalent two branch tree, and sets the subtree T (x) of T with vertex x as its root, whose left and right son vertices are y and Z, respectively.

Filename	Size	Update
3-19有向树独立K
3-19有向树独立K\kzhongzhi
3-19有向树独立K\kzhongzhi\Debug
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.exe	544823	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.ilk	785320	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.obj	243537	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.pch	203680	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.pdb	1090560	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\StdAfx.obj	1786	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\vc60.idb	66560	2017-11-26
3-19有向树独立K\kzhongzhi\Debug\vc60.pdb	118784	2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.cpp	2874	2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.dsp	4586	2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.dsw	524	2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.ncb	50176	2017-11-30
3-19有向树独立K\kzhongzhi\kzhongzhi.opt	48640	2017-11-30
3-19有向树独立K\kzhongzhi\kzhongzhi.plg	1670	2017-11-26
3-19有向树独立K\kzhongzhi\ReadMe.txt	1226	2017-11-26
3-19有向树独立K\kzhongzhi\StdAfx.cpp	296	2017-11-26
3-19有向树独立K\kzhongzhi\StdAfx.h	769	2017-11-26

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．