André Rohe

According to our database, André Rohe authored at least 6 papers between 1999 and 2003.

Collaborative distances:

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

2003

An effective congestion-driven placement framework.

Ulrich Brenner, André Rohe

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

Rectilinear group Steiner trees and applications in VLSI design.

Martin Zachariasen, André Rohe

Math. Program., 2003

Chained Lin-Kernighan for Large Traveling Salesman Problems.

David L. Applegate, William J. Cook, André Rohe

INFORMS J. Comput., 2003

2002

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.

Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze

ACM J. Exp. Algorithmics, 2002

Solution of a Min-Max Vehicle Routing Problem.

David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe

INFORMS J. Comput., 2002

1999

Computing Minimum-Weight Perfect Matchings.

William J. Cook, André Rohe

INFORMS J. Comput., 1999