Milo Chen
Reputation
268
Top tag
Next privilege 500 Rep.
Access review queues
 Jul 26 revised All-pairs top-k min-cost flow paths added 52 characters in body Jul 26 revised All-pairs top-k min-cost flow paths added 167 characters in body Jul 26 asked All-pairs top-k min-cost flow paths Jul 9 accepted Algorithm to find shortest path to net values across nodes Jul 6 comment Algorithm to find shortest path to net values across nodes @Rahul just skimmed your link and it does look like it fits my problem - thanks! It's midnight now, so I will finish reading your link and get back to you in the morning :) Jul 6 comment Algorithm to find shortest path to net values across nodes @JossevanDobbendeBruyn, you are right: I should have also stated that edge costs are non-negative. Jul 6 revised Algorithm to find shortest path to net values across nodes added 990 characters in body Jul 6 revised Algorithm to find shortest path to net values across nodes added 990 characters in body Jul 6 comment Algorithm to find shortest path to net values across nodes @JossevanDobbendeBruyn as for the existence of a minimum with negative cost cycles, consider the medicine transportation scenario outlined in the Motivation: I cannot see why the minimum cost of transporting medicine to fulfill medicine shortages should not exist. Please could you give an example. Jul 6 revised Algorithm to find shortest path to net values across nodes added 990 characters in body Jul 6 comment Algorithm to find shortest path to net values across nodes Many thanks Josse - to address an immediate point I apologise that I made a confusing typo: it should read $n_v \in \mathbf{Z}$. I will respond to the rest of your comment when I get back home tonight :) Jul 6 revised Algorithm to find shortest path to net values across nodes edited body Jul 6 asked Algorithm to find shortest path to net values across nodes Aug 5 accepted Characterisation of linearly separable points of a hypercube Aug 5 accepted How many hyperplanes does it take to separate $n$ points in $\mathbb{R}^m$? Jul 2 awarded Curious Apr 30 awarded Yearling Jun 6 comment How many cuts does it take to remove any $n$ vertices from an $m$-dimensional hypercube? Ahh yup - overlooked the obvious - thanks Jun 6 revised How many cuts does it take to remove any $n$ vertices from an $m$-dimensional hypercube? added 8 characters in body; deleted 37 characters in body Jun 6 awarded Commentator