✦ LIBER ✦

Computational complexity of the minimum committee problem and related problems

✍ Scribed by M. Yu. Khachai

Book ID: 111454064
Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 194 KB
Volume: 73
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562406010376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computational Complexity of the M

On the Computational Complexity of the Minimum Committee Problem

✍ Mikhail Yu. Khachay 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 442 KB

Computational complexity of the minimal

Computational complexity of the minimal committee problem and adjacent problems

✍ M. Yu. Khachai 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 188 KB

Computational and approximational comple

Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets

✍ M. Yu. Khachai 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 172 KB

Computational complexity of combinatoria

Computational complexity of combinatorial problems related to piecewise linear committee pattern-recognition learning procedures

✍ M. Yu. Khachai, M. I. Poberii 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 380 KB

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 Complexity of Minimum Ratio Spanning

The Complexity of Minimum Ratio Spanning Tree Problems

✍ Christopher C. Skiścim; Susan W. Palocsay 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 349 KB