Carsten Spräner

According to our database, Carsten Spräner authored at least 2 papers between 1995 and 1996.

Collaborative distances:

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

1996

Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem.

Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner

Parallel Algorithms Appl., 1996

1995

A parallel local-search algorithm for the k-partitioning problem.

Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995