?? packing.html
字號:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>packing</TITLE>
<META name="description"
content="Definition of packing,
possibly with links to more information and implementations.">
<META name="keywords" content="packing">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H1>packing</H1>
<P>
(definition)
<P>
<strong>Definition:</strong>
Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.
<P><strong>See also</strong>
<a href="covering.html" tppabs="http://hissa.nist.gov/dads/HTML/covering.html"><em>covering</em></a>.
<P><em>Note:
From Algorithms and Theory of Computation Handbook, page 32-39, 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>
<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 Jun 17 09:56:40 1999.<BR>
HTML page formatted Wed Dec 22 09:36:04 1999.
<P>
This page's URL is
<A href="packing.html" tppabs="http://hissa.nist.gov/dads/HTML/packing.html">http://hissa.nist.gov/dads/HTML/packing.html</A>
</BODY>
</HTML>
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -