J. Böckenhauer und Unger - Info zur Person

(1 - 8 von 10

)

Publications of H.-J. Böckenhauer

www-sop.inria.fr

H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal ...

Fourth IFIP International Conference on Theoretical Computer Science...

books.google.ie

Information Processing Letters 75, 2000, pp. 133– H.-J. Böckenhauer, J. Hromković, R. Klasing, S. Seibert, W. Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoretical Computer Science 285, 2002, pp. 3–24. H.-J. Böckenhauer, J. Hromković, ...

Reusing Optimal TSP Solutions for Locally Modified Input Instances ...link.springer.com › chapter

link.springer.com

H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: Approximation algorithms for TSP with sharpened triangle inequality. Information Processing ...

OUCI

ouci.dntb.gov.ua

H.-J. Böckenhauer D. Komm and W. Unger eds. (Springer International Publishing) Bell T. and Vahrenhold J CS Unplugged---How Is It Used and ... › works

EUDML | Improved Lower Bounds on the Approximability of the...

eudml.org

von HJ Böckenhauer · · Zitiert von: 40 — H.-J. Böckenhauer, J. Hromkovic, R. Klasing, S. Seibert and W. Unger, Towards the Notion of Stability of Approximation Algorithms and the Traveling Salesman ... › doc

Publication of Graphs & Applications

dept-info.labri.fr

H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal 2-connected spanning ...

Alle Infos zum Namen "J. Böckenhauer"

Verwandte Suchanfragen zu J. Böckenhauer

Personen
Vorname
Name "Böckenhauer" (41)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

J. Böckenhauer und Unger Person-Info