Campus Event Calendar: Rolf Harren (02/10/2009 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

An Absolute 2-Approximation for Two-dimensional Bin Packing

Rolf Harren

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1, AG 3, AG 5, SWS, AG 2, AG 4, RG1, MMCI

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Tuesday, 10 February 2009

14:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

The two-dimensional bin packing problem asks for a non-overlapping, axis-parallel packing of a given list of rectangles into a minimum number of unit squares. We present a polynomial time algorithm with an approximation guarantee of 2 - which is optimal unless P=NP.

Contact

Rolf Harren

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Rolf Harren, 02/05/2009 23:50 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis