✦ LIBER ✦

Improved Parameterized Set Splitting Algorithms: A

✍ Scribed by Jianer Chen; Songjian Lu

Publisher: Springer
Year: 2008
Tongue: English
Weight: 395 KB
Volume: 54
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9206-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simple and Improved Parameterized Algori

Simple and Improved Parameterized Algorithms for

✍ Mingyu Xiao 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 363 KB

An Improved Parameterized Algorithm for

✍ Jianer Chen; Yang Liu; Songjian Lu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 319 KB

An improved phase-splitting algorithm

✍ F.F.Y. Walraven; P.V. Van Rompay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Improved Approximation Algorithms for Ge

Improved Approximation Algorithms for Geometric Set Cover

✍ Kenneth L. Clarkson; Kasturi Varadarajan 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 238 KB

Splitting a Context-Sensitive Set

✍ James C. Owings Jr 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 267 KB

We prove that if A is an infinite, coinfinite context-sensitive set, there exists a deterministic context-sensitive set B such that each of the four sets A n B, A n ~, \_4 n B, A n/3 is infinite. This result points up a major difference between the inclusion lattices of the context-sensitive and rec

Algorithms and application in decision-m

Algorithms and application in decision-making for the finest splitting of a set of formulae

✍ Maonian Wu; Mingyi Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 271 KB