Jacob
Reputation
1,607
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
1 7 20
Newest
Impact
~45k people reached

• 14 helpful flags
• 168 votes cast

# 367 Actions

 Feb26 awarded Nice Answer Feb5 accepted Chinese Postman Problem (CPP) is NP-Complete for mixed graphs: why? Feb5 asked Chinese Postman Problem (CPP) is NP-Complete for mixed graphs: why? Jan6 awarded Famous Question Sep30 awarded Explainer Sep24 awarded Autobiographer Aug27 suggested rejected edit on If $u$ and $v$ are vectors in $3$-space, then $u\cdot v$ is a scalar Aug18 comment Convex optimization approximation @Adam: The problem is fairly simple in $\mathbb{R}^2$ ; is that your goal or are you looking for a general solution? Aug14 comment Get neighbors for N dimensional square @wonko: It would be more productive if you flagged such posts for moderator attention. Aug13 revised How to solve this equation (may be with least squares)? cleaned up equation Aug13 suggested approved edit on How to solve this equation (may be with least squares)? Aug5 awarded Yearling Jul30 comment How to efficiently compute the pareto front in a >2 dimensional multi-objective case? Seems to be a very poorly written paper which only claims to improve the best-case complexity ; I would stick to Kung's algorithm. Jul29 revised How to efficiently compute the pareto front in a >2 dimensional multi-objective case? deleted 9 characters in body Jul29 revised How to efficiently compute the pareto front in a >2 dimensional multi-objective case? added 53 characters in body Jul29 answered How to efficiently compute the pareto front in a >2 dimensional multi-objective case? Jul2 awarded Curious Mar14 awarded Popular Question Nov18 revised Does sum of random variables remain independent? removed "edit" statement Nov18 suggested approved edit on Does sum of random variables remain independent?