✦ LIBER ✦

Greedy Matching on the Line

✍ Scribed by Frieze, Alan; McDiarmid, Colin; Reed, Bruce

Book ID: 118176840
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 567 KB
Volume: 19
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0219045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average performance of a greedy algorith

Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space

✍ Ying The Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB

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 ## Ž .

Greedy matching on a grid

✍ Rolf G. Karlsson 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 463 KB

On the existence of weak greedy matching

On the existence of weak greedy matching heuristics

✍ M.D Grigoriadis; B Kalantari; C.Y Lai 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 480 KB

On a Greedy Heuristic for Complete Match

On a Greedy Heuristic for Complete Matching

✍ Reingold, Edward M.; Tarjan, Robert E. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 533 KB

Greedy Algorithms for On-Line Data Compr

Greedy Algorithms for On-Line Data Compression

✍ József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 191 KB

We consider on-line text-compression problems where compression is done by Ž . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i