Peter Stangier

According to our database, Peter Stangier authored at least 10 papers between 1993 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

On Complexity, Representation and Approximation of Integral Multicommodity Flows.

Anand Srivastav, Peter Stangier

Discret. Appl. Math., 2000

1997

Tight Approximations for Resource Constrained Scheduling and Bin Packing.

Anand Srivastav, Peter Stangier

Discret. Appl. Math., 1997

A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing.

Anand Srivastav, Peter Stangier

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

1996

Algorithmic Chernoff-Hoeffding inequalities in integer programming.

Anand Srivastav, Peter Stangier

Random Struct. Algorithms, 1996

1995

Weighted Fractional and Integral K-matching in Hypergraphs.

Anand Srivastav, Peter Stangier

Discret. Appl. Math., 1995

1994

Effiziente Algorithmen für Fluss- und Reihenfolgeplanungsprobleme.

Peter Stangier

PhD thesis, 1994

Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming.

Anand Srivastav, Peter Stangier

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Tight Approximations for Resource Constrained Scheduling Problems.

Anand Srivastav, Peter Stangier

Proceedings of the Algorithms, 1994

1993

On Quadratic Lattice Approximations.

Anand Srivastav, Peter Stangier

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Integer Multicommodity Flows with Reduced Demands.

Anand Srivastav, Peter Stangier

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993