Computer Science
Meta user
Network profile
335
reputation
2
12

xiaohan2012

Apparently, this user prefers to keep an air of mystery about them.

0
answers
11
questions
~11k
people reached
  • Wuhan, China
  • Member for 7 years
  • 23 profile views
  • Last seen Aug 29 at 4:16

Communities (31)

Top network posts

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
2 Confusion about finite automata construction in Knuth–Morris–Pratt algorithm Oct 18 '13
2 How to implement GREEDY-SET-COVER in a way that it runs in linear time [closed] Oct 16 '13
2 Approximated TSP: weight of minimum spanning tree less than cost of the optimal tour? Oct 16 '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
View all questions and answers →

Badges (14)

Gold

—

Silver

2

Rarest

Bronze

12

Rarest

View all badges →