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

When are NP-hard location problems easy?

โœ Scribed by Dorit S. Hochbaum

Book ID
112644120
Publisher
Springer US
Year
1984
Tongue
English
Weight
572 KB
Volume
1
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Easy and hard bottleneck location proble
Easy and hard bottleneck location problems
โœ Wen-Lian Hsu; George L. Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 302 KB
Easy problems are sometimes hard
Easy problems are sometimes hard
โœ Ian P. Gent; Toby Walsh ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 621 KB

We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that p

Allocating hard real-time tasks: An NP-H
Allocating hard real-time tasks: An NP-Hard problem made easy
โœ K. W. Tindell; A. Burns; A. J. Wellings ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer US ๐ŸŒ English โš– 1004 KB

A distributed hard real time system can be composed from a number of communicating tasks. One of the difficulties with building such systems is the problem of where to place the tasks. In general there are pr ways of allocating Ttasks to P processors, and the problem of finding an optimal feasible a