Steiner Trees
Edit Page
Report
Scan day: 09 February 2014 UTC
32
Virus safety - good
Description: Open Problems with Steiner Trees, maintained by Joe Ganley.
Of course, there are probably about a zillion open problems related to Steiner trees, but here are a few I've thought about. allows us to construct an optimal rectilinear Steiner tree of a full set in linear time. I know of no other metric or type of graph in which computing the optimal Steiner tree of a full set is polynomial-time solvable but computing a general Steiner tree is NP-hard. Note that there isn't even a sufficiently strong analogue of Hwang's theorem for rectilinear Steiner trees in three dimensions.
Size: 534 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Steiner Trees: Open Problems |
| Keywords: | |
| Description: | |
| IP-address: | 174.127.110.143 |
WHOIS Info
| NS | Name Server:DNS1.MIDPHASE.COM Name Server:DNS2.MIDPHASE.COM Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 1998-12-15T05:00:00Z Expiry Date: 2014-12-14T05:00:00Z |