zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On the minimum label spanning tree problem. (English) Zbl 0938.90064
Summary: We study the minimum label spanning tree problem. In this problem we are given an undirected graph whose edges are labeled with colors. The goal is to find a spanning tree which uses as few different colors as possible. We present an approximation algorithm with logarithmic performance guarantee. On the other hand, our hardness results show that the problem cannot be approximated within a constant factor.

90C35Programming involving graphs or networks
68W10Parallel algorithms
68R10Graph theory in connection with computer science (including graph drawing)
Full Text: DOI
[1] Arora, S.; Sudarn, M.: Improved low-degree testing and its applications. Proc. 29th annual ACM symposium on the theory of computing (STOC’97), 485-496 (1997)
[2] Chang, R. -S.; Leu, S. -J.: The minimum labeling spanning trees. Inform. process. Lett. 63, 277-282 (1997) · Zbl 0938.90063
[3] Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.: Introduction to algorithms. (1990) · Zbl 1158.68538
[4] Garey, M. R.; Johnson, D. S.: Computers and intractability. A guide to the theory of NP-completeness (1979) · Zbl 0411.68039
[5] Hochbaum, D. S.: Approximation algorithms for NP-hard problems. (1997) · Zbl 05899342