2011 | OriginalPaper | Buchkapitel
The 1-Neighbour Knapsack Problem
verfasst von : Glencora Borradaile, Brent Heeringa, Gordon Wilfong
Erschienen in: Combinatorial Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the
1-neighbour knapsack problem
, an item can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.