Pages that link to "Item:Q1034628"
From MaRDI portal
The following pages link to A sublinear-time approximation scheme for bin packing (Q1034628):
Displaying 11 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem (Q5434395) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)