📄 steinermintr.html
字号:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>Steiner minimum tree</TITLE>
<META name="description"
content="Definition of Steiner minimum tree,
possibly with links to more information and implementations.">
<META name="keywords" content="Steiner minimum tree">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H1>Steiner minimum tree</H1>
<P>
(definition)
<P>
<strong>Definition:</strong>
Given a set of <a href="vertex.html" tppabs="http://hissa.nist.gov/dads/HTML/vertex.html"><em>vertices</em></a> S in an <a href="undirectgraf.html" tppabs="http://hissa.nist.gov/dads/HTML/undirectgraf.html"><em>undirected</em></a> <a href="weightgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/weightgraph.html"><em>weighted graph</em></a>, a minimal weight <a href="spanningtree.html" tppabs="http://hissa.nist.gov/dads/HTML/spanningtree.html"><em>spanning tree</em></a> of S union Q for some added <a href="steinervertx.html" tppabs="http://hissa.nist.gov/dads/HTML/steinervertx.html"><em>Steiner vertices</em></a> Q in the <a href="graph.html" tppabs="http://hissa.nist.gov/dads/HTML/graph.html"><em>graph</em></a>.
<P><strong>See also</strong>
<a href="minspantree.html" tppabs="http://hissa.nist.gov/dads/HTML/minspantree.html"><em>minimum spanning tree</em></a>.
<P><em>Note:
This differs from the minimum spanning tree in that the set of Steiner vertices must be identified. That is, additional vertices may be used. <P> From Algorithms and Theory of Computation Handbook, page 20-12, Copyright © 1999 by CRC Press LLC.</em>
<P>Author: <a href="terms.html#authorCRC-A" tppabs="http://hissa.nist.gov/dads/terms.html#authorCRC-A">CRC-A</a>
<H2>More information</H2>
OR-Notes on network flow, including <A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/netflow.html \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/netflow.html'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/netflow.html">Steiner minimum tree</A>.
<hr>
Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.
<hr>
If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).
<p>
Entry modified Thu Jul 1 08:57:57 1999.<BR>
HTML page formatted Wed Dec 22 09:36:36 1999.
<P>
This page's URL is
<A href="steinermintr.html" tppabs="http://hissa.nist.gov/dads/HTML/steinermintr.html">http://hissa.nist.gov/dads/HTML/steinermintr.html</A>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -