#### Filter Results:

- Full text PDF available (41)

#### Publication Year

2000

2017

- This year (0)
- Last 5 years (12)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
- DIAL-M
- 2001

We consider the following optimization problem for UMTS networks: For a specified teletraffic demand and possible base station locations, choose positions for base stations such thatthe construction… (More)

- Christian Glaßer, Steffen Reith, Heribert Vollmer
- ICALP Satellite Workshops
- 2000

We consider two optimization problems for cellular telepho ne networks, that arise in a recently discussed ITU proposal for a traffic l oad model. These problems address the positioning of base… (More)

- Elmar Böhler, Christian Glaßer, Daniel Meister
- J. Comput. Syst. Sci.
- 2006

We introduce the probabilistic class SBP which is defined in aBPP-like manner. This class emerges fromBPP by keeping the promise of a probability gap but decreasing th e probability limit from 1=2 to… (More)

- Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
- Electronic Colloquium on Computational Complexity
- 2005

We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are polynomial-time many-one autoreducible. • Complete sets of any level of PH, MODPH, or the… (More)

- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
- SIAM J. Comput.
- 2008

We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by… (More)

- Christian Glaßer, Heinz Schmitz
- STACS
- 2000

– We define approximative solution notions and investigate in which cases polynomial-time solvability translates from one to another notion. Moreover, for problems where all objectives have to be… (More)

- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
- TAMC
- 2006

This expository paper describes some of the results of two recent research papers [GOP05,GPSZ05]. The first of these papers proves that every NP-complete set is many-one autoreducible. The second… (More)

- Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek
- Electronic Colloquium on Computational Complexity
- 2010

We systematically study the hardness and the approximability of combinatorial multiobjective NP optimization problems (multi-objective problems, for short). We define solution notions that precisely… (More)

- Elmar Böhler, Christian Glaßer, Daniel Meister
- MFCS
- 2003