𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Worst-case analysis of heuristics for the local microcode optimization problem

✍ Scribed by Axel Böttcher; Gisbert Lawitzky; Hans-Ulrich Simon

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
383 KB
Volume
7
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time heuristic for certain
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
✍ Svatopluk Poljak; Daniel Turzík 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 340 KB

We introduce a notion of ).-extendible property of graphs and prove: If P is a ).-extendible property (0<).<1), then for a connected graph G = (V, E) and an objective function c: E---\*R + one can construct a spanning subgraph H= (V, F) which has the property P and satisfies c(F) = ~. c(E) + ½