 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
degree-bounded minimum spanning tree是NP hard的，不过这里只对一个点有degree的要求，比较不同In Reply To:有界度生成树不是np-hard的问题吗 Posted by:hawk at 2004-01-10 12:40:36 > 可以贪心？还是这个题目有特殊条件？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
