WADS 2009 - PDF Preprint Papers

WADS 2009 Workshop on Algorithms and Data Structures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WADS-2009 Paper

click to vote

WADS
2009
Springer

378views Algorithms» more WADS 2009»

Two for One: Tight Approximation of 2D Bin Packing

14 years 6 months ago

Download aeolus.ceid.upatras.gr

In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...

Klaus Jansen, Lars Prädel, Ulrich M. Schwarz

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	378	Two for One: Tight Approximation of 2D Bin Packing	claim
2	317	Shortest Path Problems on a Polyhedral Surface	claim
3	298	A Comparison of Performance Measures for Online Algorithms	claim
4	291	On the Power of the Semi-Separated Pair Decomposition	claim
5	288	The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics	claim
6	281	The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs	claim
7	274	Approximating Transitive Reductions for Directed Networks	claim
8	274	New Results on Visibility in Simple Polygons	claim
9	268	Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing	claim
10	267	Computing the Implicit Voronoi Diagram in Triple Precision	claim
11	265	A Distribution-Sensitive Dictionary with Low Space Overhead	claim
12	262	Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs	claim
13	257	Rank-Balanced Trees	claim
14	256	Dynamic Graph Clustering Using Minimum-Cut Trees	claim
15	255	Plane Graphs with Parity Constraints	claim
16	245	Online Square Packing	claim
17	243	Resolving Loads with Positive Interior Stresses	claim
18	243	Approximation Algorithms for Buy-at-Bulk Geometric Network Design	claim
19	240	Optimal Embedding into Star Metrics	claim
20	238	Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality	claim
21	237	A Pseudopolynomial Algorithm for Alexandrov's Theorem	claim
22	236	Inspecting a Set of Strips Optimally	claim
23	232	On Making Directed Graphs Transitive	claim
24	226	Integer Programming: Optimization and Evaluation Are Equivalent	claim
25	226	Online Priority Steiner Tree Problems	claim
26	223	Fault Tolerant External Memory Algorithms	claim
27	202	Minimal Locked Trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers