Spanning Trees with Bounded Number of Branch Vertices

Authors:
Luisa Gargano;Pavol Hell;Ladislav Stacho;Ugo Vaccaro
Affiliations:
-;-;-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 10
Cited 7

Updating the Hamiltonian problem—a survey

Journal of Graph Theory
Hamiltonicity for K1,r-free graphs

Journal of Graph Theory
Algorithms for finding low degree structures

Approximation algorithms for NP-hard problems
Finding long paths and cycles in sparse Hamiltonian graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Transmission-Efficient Design and Management of Wavelength-Routed Optical Networks

Transmission-Efficient Design and Management of Wavelength-Routed Optical Networks
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
Low-Degree Spanning Trees of Small Weight

SIAM Journal on Computing
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract)

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Light trees: optical multicasting for improved performance in wavelength routed networks

IEEE Communications Magazine

Bounded-degree spanning tree problems: models and new algorithms

Computational Optimization and Applications
Approximating the Maximum Internal Spanning Tree problem

Theoretical Computer Science
There are spanning spiders in dense graphs (and we know how to find them)

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An iterative refinement algorithm for the minimum branch vertices problem

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Augmenting the edge-connectivity of a spider tree

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
New heuristics for two bounded-degree spanning tree problems

Information Sciences: an International Journal
Lower and upper bounds for the spanning tree with minimum branch vertices

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the following combinatorial optimization problem: Given a connected graph G, find a spanning tree T of G with the smallest number of branchv ertices (vertices of degree 3 or more in T). The problem is motivated by new technologies in the realm of optical networks. We investigate algorithmic and combinatorial aspects of the problem.