Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem

URN:NBN:SI:DOC-NJPJBCXP2015Patvardhan, C.Prakash, V. PremSrivastav, A.documents/doc/N/URN_NBN_SI_doc-NJPJBCXP_001.pdfdocuments/doc/N/URN_NBN_SI_doc-NJPJBCXP_001.txt339articlestr. 281-2920350-559629599015URN:NBN:SI:doc-NJPJBCXPengSlovensko društvo InformatikaInformatica (Ljubljana)InCgradnja minimalnega prekrivnega drevesahevristikainformatikainformation scienceteorija grafovFast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem