EVA STAR Trefferanzeige

Volltext Volltext.pdf1.pdf (167 KB)
URN (für Zitat) http://nbn-resolving.org/urn:nbn:de:swb:90-AAA176965
Titel Graph-based system configuration.
Autor Moldenhauer, Horst
Institution Fakultät für Informatik (INFORMATIK)
Institut für Programmstrukturen und Datenorganisation (IPD)
Dokumenttyp Buch
Jahr 1996
Erscheinungsvermerk Karlsruhe 1996. (Interner Bericht. Fakultät für Informatik, Universität Karlsruhe. 1996,20.)
Abstract
We present an optimization problem that arises in the context of
system-design and the refinement of high-level specifications.
We present a graph-based formalization of the problem, thus defining
a new optimization problem, which we call MINIMUM CONFIGURATION.
We prove MINIMUM CONFIGURATION to be NP-hard and also hard to
approximate, i.e. not to be in APX. These results are obtained by
reduction from graph coloring and SHORTEST PATH WITH FORBIDDEN PAIRS.
We show how to apply the introduced concepts to the application
domain and propose a way to identify subclasses in the input space,
for which MINIMUM CONFIGURATION can be solved efficiently.