An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
type: Item
instance of: scholarly article
title: An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
zbMATH Open document ID: 0911.90338
DOI: 10.1016/0377-2217(94)00252-5
author: K. P. K. Nair
author: Abraham P. Punnen
published in: European Journal of Operational Research
publication date: 1999-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1208616
zbMATH Keywords: max + sum spanning tree problem
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00252-5
OpenAlex ID: W2006750912
cites work: Q4773298
cites work: Minimum deviation and balanced optimization: A unified approach
cites work: On finding most uniform spanning trees
cites work: Minimum deviation problems
cites work: Solving combinatorial problems with combined min-max-min-sum objective and applications
cites work: On combined minmax-minsum optimization
cites work: A data structure for dynamic trees
description: scientific article; zbMATH DE number 1208616