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

170views Algorithms» more WADS 2009»

Two for One: Tight Approximation of 2D Bin Packing

1 years 12 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	170	Two for One: Tight Approximation of 2D Bin Packing	claim
2	112	The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics	claim
3	94	Plane Graphs with Parity Constraints	claim
4	93	Shortest Path Problems on a Polyhedral Surface	claim
5	93	Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality	claim
6	89	Dynamic Graph Clustering Using Minimum-Cut Trees	claim
7	87	The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs	claim
8	87	Inspecting a Set of Strips Optimally	claim
9	83	A Distribution-Sensitive Dictionary with Low Space Overhead	claim
10	82	Computing the Implicit Voronoi Diagram in Triple Precision	claim
11	82	On the Power of the Semi-Separated Pair Decomposition	claim
12	82	A Pseudopolynomial Algorithm for Alexandrov's Theorem	claim
13	81	Optimal Embedding into Star Metrics	claim
14	80	Approximation Algorithms for Buy-at-Bulk Geometric Network Design	claim
15	78	Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs	claim
16	76	Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing	claim
17	75	New Results on Visibility in Simple Polygons	claim
18	75	Fault Tolerant External Memory Algorithms	claim
19	72	Minimal Locked Trees	claim
20	72	Integer Programming: Optimization and Evaluation Are Equivalent	claim
21	69	Rank-Balanced Trees	claim
22	69	Approximating Transitive Reductions for Directed Networks	claim
23	69	Resolving Loads with Positive Interior Stresses	claim
24	69	A Comparison of Performance Measures for Online Algorithms	claim
25	69	Online Priority Steiner Tree Problems	claim
26	63	On Making Directed Graphs Transitive	claim
27	62	Online Square Packing	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers