๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Computational Complexity of the Minimum Committee Problem

โœ Scribed by Mikhail Yu. Khachay

Publisher
Springer Netherlands
Year
2007
Tongue
English
Weight
442 KB
Volume
6
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The computational complexity of the ฮบ-mi
The computational complexity of the ฮบ-minimum spanning tree problem in graded matrices
โœ T. Dudรกs; B. Klinz; G.J. Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 524 KB

Given an undirected graph G = (V, E) where each edge e = (i,j) has a length dij >\_ O, the k-minimum spanning tree problem, k-MST for short, is to find a tree T in G which spans at least k vertices and has minimum length l(T) = ~'~(~,j)e T dij. We investigate the computational complexity of the k-mi

The computational complexity of the reli
The computational complexity of the reliability problem on distributed systems
โœ Min-Sheng Lin; Deng-Jyi Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (