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
Approximation Scheme
100%
New Item
100%
Cube Packing
100%
Robust Approximation
100%
Unit Size
66%
Polynomial-time Approximation Scheme
66%
Asymptotic Polynomial
66%
Minimum number
66%
Bin Packing
33%
Bin Packing Problem
33%
Polynomial-time Algorithm
33%
Media Items
33%
Robust Algorithm
33%
Approximate Solution
33%
Robust Polynomials
33%
Single Input
33%
One-dimensional Bin Packing
33%
Computer Science
approximation scheme
100%
Time Approximation Scheme
66%
Polynomial Time
66%
Bin Packing Problem
33%
Constant Factor
33%
Polynomial Time Algorithm
33%
Approximate Solution
33%
Mathematics
Cube
100%
Polynomial Time
75%
Asymptotics
50%
Packing Problem
25%
Constant Factor
25%
Robust Algorithm
25%
Approximate Solution
25%
Robust Design
25%