Results 1 to 2 of 2

Math Help - Algorithm to traverse a map (comp sci)

  1. #1
    Member
    Joined
    Sep 2010
    Posts
    96

    Algorithm to traverse a map (comp sci)

    Given a topographical map that lists the altitude along the direct road between any two neighboring cities, and two cities a and b, how would you develop a linear time algorithm that finds a route from a to b that minimizes the maximum altitude? Roads can be traveled in both directions.

    I have no idea how to begin this problem, can anyone help?

    Thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,530
    Thanks
    774

    Re: Algorithm to traverse a map (comp sci)

    This is the widest path problem. The reference "On the bottleneck shortest path problem" by Kaibel and Peinhardt in the bottom of the page seems nice.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Mature student for Comp. Science
    Posted in the New Users Forum
    Replies: 0
    Last Post: December 14th 2012, 01:30 AM
  2. Comp Plan Hellp!
    Posted in the Business Math Forum
    Replies: 3
    Last Post: June 4th 2010, 09:47 AM
  3. comp of functions
    Posted in the Pre-Calculus Forum
    Replies: 6
    Last Post: September 18th 2009, 05:35 AM
  4. Congruent Supp. and Comp.
    Posted in the Geometry Forum
    Replies: 2
    Last Post: September 26th 2007, 03:40 PM

Search Tags


/mathhelpforum @mathhelpforum