Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research units
Research output
Search by expertise, name or affiliation
Robust approximation schemes for cube packing
Leah Epstein
, Asaf Levin
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Robust approximation schemes for cube packing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Solution
33%
Approximation Scheme
100%
Asymptotic Polynomial
66%
Bin Packing
33%
Bin Packing Problem
33%
Cube Packing
100%
Media Items
33%
Minimum number
66%
New Item
100%
One-dimensional Bin Packing
33%
Polynomial-time Algorithm
33%
Polynomial-time Approximation Scheme
66%
Robust Algorithm
33%
Robust Approximation
100%
Robust Polynomials
33%
Single Input
33%
Unit Size
66%
Computer Science
Approximate Solution
33%
approximation scheme
100%
Bin Packing Problem
33%
Constant Factor
33%
Polynomial Time
66%
Polynomial Time Algorithm
33%
Time Approximation Scheme
66%
Mathematics
Approximate Solution
25%
Asymptotics
50%
Constant Factor
25%
Cube
100%
Packing Problem
25%
Polynomial Time
75%
Robust Algorithm
25%
Robust Design
25%