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
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
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
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