There is no asymptotic PTAS for two-dimensional vector packing (Q293152): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590650 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
analysis of algorithms | |||
| Property / zbMATH Keywords: analysis of algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial problems | |||
| Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
worst-case analysis | |||
| Property / zbMATH Keywords: worst-case analysis / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation scheme | |||
| Property / zbMATH Keywords: approximation scheme / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vector packing | |||
| Property / zbMATH Keywords: vector packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bin packing | |||
| Property / zbMATH Keywords: bin packing / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line and off-line approximation algorithms for vector covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Packing Two-Dimensional Bins / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Resource constrained scheduling as generalized bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional Bin Packing Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New Algorithms for Bin Packing / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117812463 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There is no asymptotic PTAS for two-dimensional vector packing |
scientific article |
Statements
There is no asymptotic PTAS for two-dimensional vector packing (English)
0 references
9 June 2016
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
worst-case analysis
0 references
approximation scheme
0 references
vector packing
0 references
bin packing
0 references
