Improving spanning trees by upgrading nodes
type: Item
instance of: scholarly article
title: Improving spanning trees by upgrading nodes
zbMATH Open document ID: 0930.68003
DOI: 10.1016/S0304-3975(99)00030-4
author: Sven O. Krumke
author: Hartmut Noltemeier
author: Madhav V. Marathe
author: R. Ravi
author: H.-C. Wirth
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1387424
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation algorithms
zbMATH Keywords: network design
zbMATH Keywords: spanning tree
MaRDI profile type: Publication
cites work: An algebraic theory of graph reduction
cites work: Improving the location of minisum facilities through network modification
cites work: Linear-time computation of optimal subgraphs of decomposable graphs
cites work: Q3619797
cites work: Q4228484
cites work: Q4198056
cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs
cites work: Q4395331
cites work: Modifying edges of a network to obtain short subgraphs
cites work: On budget-constrained flow improvement.
cites work: Network upgrading problems
cites work: Graph minors. IV: Tree-width and well-quasi-ordering
cites work: The Recognition of Series Parallel Digraphs
description: scientific article; zbMATH DE number 1387424