xiaohan2012
  • Member for 9 years, 2 months
  • Last seen more than a month ago
  • Wuhan, China
0 answers
1 votes
35 views
NP-hardness of maximum set cover with element-level submodular function
1 answers
1 votes
92 views
1 bookmarks
Label coloring to maximize number of "balanced" triangles (NP-hardness)
1 answers
3 votes
221 views
1 bookmarks
NP-hardness of maximum set cover with even/odd coverage requirement
0 answers
1 votes
115 views
NP-completeness of maximum-sum subtree with quadratic constraint
0 answers
1 votes
99 views
NP-hardness of Capacitated Minimum Spanning Tree and Price Collecting Steiner Tree on dag/tree
2 answers
2 votes
2k views
3 bookmarks
Confusion about finite automata construction in Knuth–Morris–Pratt algorithm
1 answers
1 votes
2k views
1 bookmarks
Approximated TSP: weight of minimum spanning tree less than cost of the optimal tour?
2 answers
4 votes
3k views
1 bookmarks
without triangle inequality, finding good approximate tours for TSP in polynomial time is impossible unless P=NP?
1 answers
3 votes
6k views
2 bookmarks
How to implement GREEDY-SET-COVER in a way that it runs in linear time
2 answers
3 votes
254 views
1 bookmarks
Drawbacks of repeating a single pattern matching procedure for many patterns
1 answers
2 votes
124 views
NP-COMPLETE:Why say "reduction algorithm computes reduction function"?