( en | de | ru )

 

Disambiguation of "Woeginger, Gerhard J."

Author of the publication

copydeleteadd this publication to your clipboard
The Traveling Salesman Problem under Squared Euclidean Distances.

, , , , and . STACS, volume 5 of LIPIcs, page 239-250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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.

Gerhard J Gröbner

Gerhard J Fraune

Heinrich J J Mieschendahl

Norbert J J Bock

J J M Ramakers

 

Other publications of authors with the same name

Geometric Clusterings., , and . J. Algorithms, 12 (2): 341-356 (1991)On-Line and Off-Line Approximation Algorithms for Vector Covering Problems., , , , , , and . Algorithmica, 21 (1): 104-118 (1998)The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices., and . J. Comb. Optim., 3 (1): 51-58 (1999)An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling., and . SIAM J. Comput., 22 (2): 349-355 (1993)Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., , , , , and . CoRR, (2017)When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?. SODA, page 820-829. ACM/SIAM, (1999)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)Competitive Odds and Ends., and . Online Algorithms, volume 1442 of Lecture Notes in Computer Science, page 385-394. Springer, (1996)An Approximation Scheme for Cake Division with a Linear Number of Cuts.. ESA, volume 2461 of Lecture Notes in Computer Science, page 896-901. Springer, (2002)Sometimes Travelling is Easy: The Master Tour Problem., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 128-141. Springer, (1995)