# 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.

#### One Citation

#### References

SHOWING 1-10 OF 11 REFERENCES

The complexity of the network design problem

- Mathematics, Computer Science
- Networks
- 1978

MAD trees and distance-hereditary graphs

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2003

On the Approximability of the Minimum Fundamental Cycle Basis Problem

- Mathematics, Computer Science
- WAOA
- 2003

A polynomial time algorithm for finding the absolute center of a network

- Mathematics, Computer Science
- Networks
- 1981

Combinatorial network abstraction by trees and distances

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2008

On the Minimum Diameter Spanning Tree Problem

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1995