@article{Eppstein1992, 
     author = "Eppstein, David", 
     doi = "10.1007/BF01994879", 
     issn = "00063835", 
     journal = "BIT", 
     keyword = "F.1.3,F.2.2,G.2.2,I.2.8", 
     link = "http://link.springer.com/10.1007/BF01994879", 
     month = "jun", 
     number = "2", 
     pages = "237--248", 
     title = "Finding the k smallest spanning trees", 
     uri = "http://link.springer.com/10.1007/BF01994879", 
     volume = "32", 
     year = "1992", 
}

Problems: 47 48 49 50