๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


New algorithms for selection
โœ Prakash V Ramanan; Laurent Hyafil ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 963 KB
Approximation Algorithms for Independent
โœ 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