min Manhattan distance

Let's talk about algorithms!

Moderator: Board moderators

Post Reply
onako
New poster
Posts: 1
Joined: Fri Mar 04, 2011 12:59 pm

min Manhattan distance

Post by onako » Fri Mar 04, 2011 1:48 pm

Given a set of points in 2D, I'm supposed to find a point that
a) minimizes the sum of Manhattan distances to these points
b) minimizes the sum of squared Manhattan distances to these points

For a) I would need to choose a median on x-axis and combine it with the median in y-axis.
But, I'm not sure how b) is different? Any suggestion on how to approach the problem is welcome.
Thanks

jj7947
New poster
Posts: 1
Joined: Fri Jan 27, 2012 7:26 pm

Re: min Manhattan distance

Post by jj7947 » Fri Jan 27, 2012 9:55 pm

Would you have to compute the walking distance between each point on the x-axis and y-axis?

Post Reply

Return to “Algorithms”