✦ LIBER ✦

Greedy codes

✍ Scribed by Richard A Brualdi; Vera S Pless

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 837 KB
Volume: 64
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(93)90085-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Greedy Codes

✍ D. Fon-Der-Flaass 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

In their paper (J. Combin. Theory Ser. A 64 (1993), 10 30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that

Greedy Boss

✍ Cruz, C L 📂 Fiction 📅 2020 🌐 English ⚖ 106 KB

Recognizing Greedy Structures

✍ Yair Caro; András Sebo&#x030B;; Michael Tarsi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 190 KB

We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs of N

On randomized greedy matchings

✍ Zevi Miller; Dan Pritikin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

where the class ⌬-GRAPHS is the set of graphs of maximum degree at most ⌬ . ᮊ 1997 John ## Ž .

A ‘greedy’ channel router

✍ Ronald L. Rivest; Charles M. Fiduccia 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 701 KB

A 'greedy' channel-router is presented. It is quick, simple and effective. It always succeeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections "off the end' of the channel, in order to succeed. It assumes that all p

Greedy Dynamic Routing on Arrays

✍ Nabil Kahale; Tom Leighton 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 212 KB

We study the problem of dynamic routing on arrays. We prove that a large class of greedy algorithms perform very well on average. In the dynamic case, when the arrival rate of packets in an N = N array is at most 99% of network capacity, we establish an exponential bound on the tail of the delay dis