Page 3 of 3

Posted: Sat Feb 04, 2006 8:09 am
by FAQ
I got ..P.E (the 50-th PE) at last
Thanks Hadi and kp for your explanations
Thanks Adbenego, nice problems :)

Re: 10984 - Double NP-hard

Posted: Sun Mar 13, 2011 10:39 pm
by DD
It is really a nice problem. Since minimum vertex cover and maximum independent set are dual, with clever combinations and modifications this problem become polynominal time solvable. Thanks problem setter :D

Re: 10984 - Double NP-hard

Posted: Sun Mar 13, 2011 11:46 pm
by Abednego
You are welcome. I'm glad you liked it.