✦ 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
DOI: 10.1007/s00453-010-9389-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

A ( °/2) -approximation algorithm for th

A ( °/2) -approximation algorithm for the maximum independent set problem

✍ V.Th. Paschos 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 221 KB

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

An improved approximation ratio for the

An improved approximation ratio for the minimum latency problem

✍ Michel Goemans; Jon Kleinberg 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 860 KB

An approximation algorithm for the wirel

An approximation algorithm for the wireless gathering problem

✍ Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 629 KB

An approximation algorithm for the regis

An approximation algorithm for the register allocation problem

✍ 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