Reload cost problems: minimum diameter spanning tree

An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians

Oded Kariv, S. L. Hakimi · SIAM Journal on Applied Mathematics · 1979 · 1.3K citations

Engineering, Planar Graph, Network Analysis +18

An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers

Oded Kariv, S. L. Hakimi · SIAM Journal on Applied Mathematics · 1979 · 549 citations

Engineering, Network Planning, Planar Graph +19

A threshold of ln <i>n</i> for approximating set cover (preliminary version)

Uriel Feige · 1996 · 212 citations · Full text

Theory Of Computing, Computational Science, Engineering +13

The minimum labeling spanning trees

Ruay-Shiung Chang, Leu Shing-Jiuan · Information Processing Letters · 1997 · 125 citations

Mathematical Programming, Engineering, Graph Theory +10

On the minimum diameter spanning tree problem

Refael Hassin, Arie Tamir · Information Processing Letters · 1995 · 111 citations

Mathematical Programming, Minimum Diameter, Graph Minor +9