To solve the 1-Center problem on a graph we propose two very efficient heuristic procedures that give good aproximate solutions and that can also be used to improve the eficiency of Minieka and Handler exact algorithms.