𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Cooperative Search Method for thek-Coloring Problem

✍ Scribed by Hend Bouziri; El-Ghazali Talbi; Khaled Mellouli

Book ID
106390132
Publisher
Springer Netherlands
Year
2008
Tongue
English
Weight
351 KB
Volume
7
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Branch and bound methods for a search pr
Branch and bound methods for a search problem
✍ Alan R. Washburn πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A Constant-Factor Approximation Algorith
A Constant-Factor Approximation Algorithm for thek-MST Problem
✍ Avrim Blum; R Ravi; Santosh Vempala πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 186 KB

Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the opti