#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (9)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Klaus Jansen, Kim-Manuel Klein, José Verschae
- ICALP
- 2016

Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of n jobs to a set ofm identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a (1 + ε)-approximation algorithm with a running time… (More)

- Klaus Jansen, Kim-Manuel Klein
- ICALP
- 2013

In this paper we develop general LP and ILP techniques to find an approximate solution with improved objective value close to an existing solution. The task of improving an approximate solution is closely related to a classical theorem of Cook et al. [7] in the sensitivity analysis for LPs and ILPs. This result is often applied in designing robust… (More)

- Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
- APPROX-RANDOM
- 2015

We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion. The goal is to minimize the number of used bins at every timestep while repacking of already packed items is allowed. Ivković and Lloyd [IL98] have developed an algorithm with asymptotic competitive ratio of 5/4 using O(log n) (amortized) shifting moves… (More)

- Cristina Bazgan, Ljiljana Brankovic, +7 authors Vangelis Th. Paschos
- IWOCA
- 2016

- Klaus Jansen, Kim-Manuel Klein
- SODA
- 2017

We consider the bin packing problem with d different item sizes and revisit the structure theorem given by Goemans and Rothvoß [GR14] about solutions of the integer cone. We present new techniques on how solutions can be modified and give a new structure theorem that relies on the set of vertices of the underlying integer polytope. As a result of our new… (More)

- Kim-Manuel Klein
- Encyclopedia of Algorithms
- 2016

- Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig
- APPROX-RANDOM
- 2017

We consider the relaxed online strip packing problem, where rectangular items arrive online and have to be packed into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the migration factor, defined as the total size of repacked items divided by… (More)

- Kim-Manuel Klein
- 2017

- Cristina Bazgan, Ljiljana Brankovic, +7 authors Vangelis Th. Paschos
- AAIM
- 2016

- ‹
- 1
- ›