There is no EPTAS for two-dimensional knapsack

In the d-dimensional ( vector) knapsack problem given is a set of items, each having a d-dimensional size vector and a profit, and a d-dimensional bin. The goal is to select a subset of the items of maximum total profit such that the sum of all vectors is bounded by the bin capacity in each dimensio...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 110; číslo 16; s. 707 - 710
Hlavní autoři:	Kulik, Ariel, Shachnai, Hadas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 31.07.2010 Elsevier Elsevier Sequoia S.A
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximations and expansions Computer science; control theory; systems Efficient polynomial-time approximation schemes Exact sciences and technology Knapsack problem Mail order Mathematical analysis Mathematics Miscellaneous Parameterized complexity Probabilistic analysis Problem solving Running Sciences and techniques of general use Studies Theoretical computing Theory of computation Two dimensional Two-dimensional knapsack Vectors (mathematics) Theory of computation Efficient polynomial-time approximation schemes Two-dimensional knapsack Parameterized complexity Computer theory Polynomial approximation Approximation algorithm Complexity Knapsack problem Polynomial time Maximum Information processing Two-dimensional calculations Vector Algorithm analysis
ISSN:	0020-0190, 1872-6119
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!