𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing Greedy Structures

✍ Scribed by Yair Caro; András Sebő; Michael Tarsi

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
190 KB
Volume
20
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

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 NP-hardness of the recognition problem for some other cases. Previous results of this type are also stated and reviewed.

📜 SIMILAR VOLUMES

Improved greedy algorithm for protein st
Improved greedy algorithm for protein structure reconstruction
✍ Pierre Tuffery; Frédéric Guyon; Philippe Derreumaux 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract This article concerns the development of an improved greedy algorithm for protein structure reconstruction. Our stochastic greedy algorithm, which attempts to locate the ground state of an approximate energy function, exploits the fact that protein structures consist of overlapping stru

cover
Greedy Boss
✍ Cruz, C L 📂 Fiction 📅 2020 🌐 English ⚖ 106 KB
Greedy codes
Greedy codes
✍ Richard A Brualdi; Vera S Pless 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 837 KB
Recognizing and eliminating structural c
Recognizing and eliminating structural complexity
✍ George Elliott 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

I f an organization is deeply seated in a quagmire of structural complexity, the situation, at best, limits performance, and, at worst, can lead to a business's demise. Most often, when people speak of complexity, they do so only within the context of operations. How complex are daily shop floor man

Recognizing linear structure in noisy ma
Recognizing linear structure in noisy matrices
✍ Marianna Bolla 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Behaviour of the eigenvalues of random matrices with an underlying linear structure is investigated, when the structure is exposed to random noise. The question, how a deterministic skeleton behind a random matrix can be recognized, is also discussed. Such random matrices, as weight matrices of rand