Skip to main content
mhsnk's user avatar
mhsnk's user avatar
mhsnk's user avatar
mhsnk
  • Member for 9 years
  • Last seen more than a month ago
  • USA
awarded
awarded
accepted
comment
Batched Coupon Collector Problem
It's been a long time that I have worked on this problem and I totally forgot it. But to your wisdom, I will just untag the accepted solution.
comment
Minimal spanning set of binary vectors
I need a solution for general m as m is not a power of two in my problem.
revised
Loading…
comment
Minimal spanning set of binary vectors
Thank you for your answer @Ilya . In my problem, I actually need the vectors to have a minimum Hamming distance of $d$. Sorry, I did not mention this earlier in my problem. I have edited the problem now to include this concern. Can we tweak your response to accommodate this concern?
revised
Minimal spanning set of binary vectors
added 65 characters in body
Loading…
asked
Loading…
comment
Need a graph theory problem with nontrivial faster approximation algorithm
Minimum Spanning Tree is not an NP-Hard problem and Polynomial time algorithms like Prim and Kruskal exist for MST. What do you mean by approximation algorithm for a problem which is not NP-Hard?
awarded
awarded
awarded
awarded
Loading…
Loading…
Loading…
awarded
comment
Average minimum number of random k-sparse vectors in $\mathbb{F}_2^n$ to span a specific base vector?
There is a typo above. I am hoping to find the minimizing choice of $k$ as a function of $n$ and not $m$.