๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Approximation Algorithm for the Minimum Co-Path Set Problem

โœ Scribed by Zhi-Zhong Chen; Guohui Lin; Lusheng Wang


Publisher
Springer
Year
2010
Tongue
English
Weight
590 KB
Volume
60
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An approximation algorithm for the regis
โœ K. Jansen; J. Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can