Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

From MaRDI portal
Publication:6090896
Jump to:navigation, search

DOI10.4230/lipics.approx/random.2021.22OpenAlexW3204767994MaRDI QIDQ6090896

Eklavya Sharma, Arindam Khan

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/pdf/2105.02827


zbMATH Keywords

approximation algorithmsgeometric bin packingguillotine separability


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)


Related Items (1)

There is no APTAS for 2-dimensional vector bin packing: revisited







This page was built for publication: Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6090896&oldid=35532644"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 06:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki