𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding a Maximum Planar Subset of a Set of Nets in a Channel

✍ Scribed by Supowit, K.J.

Book ID
118698211
Publisher
IEEE
Year
1987
Tongue
English
Weight
256 KB
Volume
6
Category
Article
ISSN
0278-0070

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of finding a local max
On the complexity of finding a local maximum of functions on discrete planar subsets
✍ Anton Mityagin πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 237 KB

We study how many values of an unknown integer-valued function f one needs to know in order to ΓΏnd a local maximum of f. We consider functions deΓΏned on ΓΏnite subsets of discrete plane. We prove upper bounds for functions deΓΏned on rectangles and present lower bounds for functions deΓΏned on arbitrar

Maximum Antichains in Random Subsets of
Maximum Antichains in Random Subsets of a Finite Set
✍ Deryk Osthus πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p