July 1, 2001
      
                  
        
  Author(s)
  Isabel M. Beichl,   Dianne M. O'Leary,   F  Sullivan
 
       
            
    
    
        Our starting point is an algorithm of Kenyon, Randall, and Sinclair, which built upon the ideas of Jerrum and Sinclair, giving an approximation to crucial parameters of the monomer-dimer covering problem in polynomial time. We make two key improvements to