Corpus ID: 18572773

The Complexity of Computing Graph-Approximating Spanning Trees

@inproceedings{Baumgart2008TheCO,
  title={The Complexity of Computing Graph-Approximating Spanning Trees},
  author={M. Baumgart},
  year={2008}
}
This paper deals with the problem of computing a spanning tree of a connected undirected graph G = (V,E) minimizing the sum of distance differences of all vertex pairs u, v ∈ V which are connected by an edge {u, v} ∈ E. We show that the decision variant of this optimization problem is NP-complete with respect to the Lp norm for arbitrary p ∈ N. For the reduction, we use the well known NP-complete problem Vertex Cover. 
1 Citations

Figures from this paper

Ranking and ordering problems of spanning trees

References

SHOWING 1-10 OF 11 REFERENCES
The complexity of the network design problem
Algorithms for Generating Fundamental Cycles in a Graph
MAD trees and distance-hereditary graphs
On the Approximability of the Minimum Fundamental Cycle Basis Problem
A polynomial time algorithm for finding the absolute center of a network
  • E. Minieka
  • Mathematics, Computer Science
  • Networks
  • 1981
Complexity of spanning tree problems: Part I
Combinatorial network abstraction by trees and distances
On the Minimum Diameter Spanning Tree Problem
Approximating Minimum Communication Cost Spanning Trees and Related Problems
Optimum Communication Spanning Trees
  • T. C. Hu
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1974
...
1
2
...