A heuristic algorithm for the mini-max spanning forest problem
type: Item
instance of: scholarly article
title: A heuristic algorithm for the mini-max spanning forest problem
zbMATH Open document ID: 0918.90135
DOI: 10.1016/0377-2217(94)00335-1
author: Takeo Yamada
author: Hideo Takahashi
author: Seiji Kataoka
published in: European Journal of Operational Research
publication date: 1999-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1252862
zbMATH Keywords: spanning forest
zbMATH Keywords: mini-max problem
zbMATH Keywords: heuristics
zbMATH Keywords: graph theory
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00335-1
OpenAlex ID: W1973984239
cites work: Q3056948
cites work: `` Strong '' NP-Completeness Results
cites work: On the History of the Minimum Spanning Tree Problem
cites work: Q4142699
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
description: scientific article; zbMATH DE number 1252862