English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14781193      Online Users : 53
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80804

    Title: The Full Steiner Tree Problem
    Authors: Lu, C. L.;Tang, C.Y.;Lee, R. C. T.
    教師: 李家同
    Date: 2003
    Publisher: Elsevier
    Relation: THEORETICAL COMPUTER SCIENCE, Elsevier, Volume 306, Issue 1-3, SEP 5 2003, Pages 55-67
    Keywords: Full Steiner tree problem
    Phylogenetic tree
    Evolutionary tree
    MAX SNP-hard
    Approximation algorithm
    Abstract: Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V, E) with a length function on E and a proper subset R subset of V, the problem is to find a full Steiner tree of minimum length in G, which is a kind of Steiner tree with all the vertices of R as its leaves. In this paper, we show that this problem is NP-complete and MAX SNP-hard, even when the lengths of the edges are restricted to either I or 2. For the instances with lengths either I or 2, we give a 8/5-approximation algorithm to find an approximate solution for the problem.
    Relation Link: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80804
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback