On the complexity of graph tree partition problems.
type: Item
instance of: scholarly article
title: On the complexity of graph tree partition problems.
zbMATH Open document ID: 1074.68043
DOI: 10.1016/S0166-218X(03)00340-8
author: Roberto Cordone
author: Francesco Maffioli
published in: Discrete Applied Mathematics
publication date: 2004-01-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2032808
zbMATH Keywords: Tree partition
zbMATH Keywords: Computational complexity
zbMATH Keywords: Greedy algorithm
MaRDI profile type: Publication
cites work: Balanced spanning forests and trees
cites work: Heuristics with Constant Error Guarantees for the Design of Tree Networks
cites work: Q3312256
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Q4198056
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Approximation Algorithms for Min–Max Tree Partition
cites work: Approximation algorithms for minimum tree partition
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: A greedy heuristic for a minimum-weight forest problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: The complexity of the capacitated tree problem
cites work: Q4111952
cites work: A heuristic algorithm for the mini-max spanning forest problem
cites work: A branch-and-bound algorithm for the mini-max spanning forest problem
description: scientific article; zbMATH DE number 2032808