( en | de | ru )

 

Disambiguation of "Böckenhauer, Hans-Joachim"

Author of the publication

copydeleteadd this publication to your clipboard
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem

, , , , and . Electron. Colloquium Comput. Complex., (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans-Joachim Böckenhauer

Detlef Böckenhauer

Martin Böckenhauer

Michael Böckenhauer

Jens Böckenhauer

 

Other publications of authors with the same name

Stability of Approximation., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)On the Hardness of Reoptimization with Multiple Given Solutions., , and . Fundam. Informaticae, 110 (1-4): 59-76 (2011)Efficient Algorithms for the Spoonerism Problem., , , , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 78-92. Springer, (2007)Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract)., and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 227-238. Springer, (2004)Exploring Sparse Graphs with Advice (Extended Abstract)., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 102-117. Springer, (2018)On the Approximability of Splitting-SAT in 2-CNF Horn Formulas., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 54-66. Springer, (2013)Knowing All Optimal Solutions Does Not Help for TSP Reoptimization., , and . Computation, Cooperation, and Life, volume 6610 of Lecture Notes in Computer Science, page 7-15. Springer, (2011)Improved Approximations for Hard Optimization Problems via Problem Instance Classification., , and . Rainbow of Computer Science, volume 6570 of Lecture Notes in Computer Science, page 3-19. Springer, (2011)Protein folding in the HP model on grid lattices with diagonals., and . Discret. Appl. Math., 155 (2): 230-256 (2007)Priority Algorithms with Advice for Disjoint Path Allocation Problems., , and . CoRR, (2022)