First Page | Document Content | |
---|---|---|
![]() Date: 1999-07-26 14:14:46Spanning tree NP-complete problems Euclidean minimum spanning tree Minimum spanning tree Delaunay triangulation Relative neighborhood graph Steiner tree problem Closest pair of points problem Planar graph Graph theory Theoretical computer science Mathematics | Source URL: www.ics.uci.eduDownload Document from Source WebsiteFile Size: 146,48 KBShare Document on Facebook |
![]() | Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1DocID: 1tff1 - View Document |
![]() | comput. complex), 281 – 040281–27 DOIs00037c Birkh¨DocID: 1rc9S - View Document |
![]() | A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit KumarDocID: 1r7hn - View Document |
![]() | LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree ReconstructionDocID: 1qRse - View Document |
![]() | A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†DocID: 1qObK - View Document |