Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Galbiati:1997:ASM, author = "Giulia Galbiati and Angelo Morzenti and Francesco Maffioli", title = "On the approximability of some {Maximum Spanning Tree Problems}", journal = j-THEOR-COMP-SCI, volume = "181", number = "1", pages = "107--118", day = "15", month = jul, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:21:01 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=181&issue=1&aid=2467", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240C (Computational complexity); C4260 (Computational geometry)", conflocation = "Valparaiso, Chile; 3-7 April 1995", conftitle = "Second International Symposium on Latin American Theoretical Informatics", corpsource = "Dipartimento di Inf. e Sistemistica, Pavia Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximability; computational complexity; computational geometry; graph theory; lineal spanning tree; MAX-SNP hard; maximum height; maximum spanning tree problems; polynomial time; spanning trees; trees (mathematics); undirected graphs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }