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

Certain NP-complete matching problems

โœ Scribed by G. Loizou


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
311 KB
Volume
32
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An NP-complete matching problem
โœ David A. Plaisted; Samuel Zaks ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 847 KB
On the np-completeness of certain networ
โœ S. Even; O. Goldreich; S. Moran; P. Tong ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen

NP-complete scheduling problems
โœ J.D. Ullman ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 423 KB

We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah

Complete problems for monotone NP
โœ Iain A. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 768 KB
Neural networks for NP-complete problems
โœ Marco Budinich ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 547 KB

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound ma