We changed our privacy policy. Read more.
Computer Science
xiaohan2012
  • Wuhan, China
  • Member for 8 years, 10 months
Profile Activity
Stats
335
reputation
13k
reached
0
answers
11
questions
top 45% overall
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (32)

Top network posts

This user doesn’t have any gold badges yet.
2
silver badges
12
bronze badges
View all badges

Top tags (23)

Score 0
Posts 5
Posts % 45
Score 0
Posts 5
Score 0
Posts 5
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 2
View all tags →

Top posts (11)

All Questions Answers
Votes Newest
4 without triangle inequality, finding good approximate tours for TSP in polynomial time is impossible unless P=NP? Oct 16 '13
3 NP-hardness of maximum set cover with even/odd coverage requirement Jul 14 '16
3 Drawbacks of repeating a single pattern matching procedure for many patterns Oct 1 '13
3 How to implement GREEDY-SET-COVER in a way that it runs in linear time [closed] Oct 16 '13
2 Confusion about finite automata construction in Knuth–Morris–Pratt algorithm Oct 18 '13
2 NP-COMPLETE:Why say "reduction algorithm computes reduction function"? Sep 27 '13
1 NP-hardness of maximum set cover with element-level submodular function Nov 2 '17
1 Label coloring to maximize number of "balanced" triangles (NP-hardness) Jul 19 '16
1 NP-completeness of maximum-sum subtree with quadratic constraint Oct 31 '15
1 NP-hardness of Capacitated Minimum Spanning Tree and Price Collecting Steiner Tree on dag/tree Oct 31 '15
View all questions and answers →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.