✦ LIBER ✦

Distributed algorithms for selection in sets

✍ Scribed by Greg N. Frederickson

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 800 KB
Volume: 37
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90012-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Prototype selection algorithms for distr

Prototype selection algorithms for distributed learning

✍ Ireneusz Czarnowski 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A distributed algorithm for k-dominating

A distributed algorithm for k-dominating sets

✍ Lucia Draque Penso; Valmir Carneiro Barbosa 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 213 KB

New algorithms for selection

✍ Prakash V Ramanan; Laurent Hyafil 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Algorithms for maximum independent sets

✍ J.M Robson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 926 KB

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

Efficient implementation of Jacobi algor

Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures

✍ P.J. Eberlein; Haesun Park 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 939 KB