most citedOn the minimum spanning tree problem in imprecise set-up

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CG2021★ 1 cited

On the minimum spanning tree problem in imprecise set-up

Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy

In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in…