( en | de | ru )

 

Disambiguation of "Sitters, René"

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.

René Berndt

Einfluss eines diabaten Turboladermodells auf die Gesamtprozess-Simulation abgasturboaufgeladener PKW-Dieselmotoren. TU Berlin, (2009)

Horst Renemann

Ekkehart Renesse

Dorothea Renesse

Thomas Renette

 

Other publications of authors with the same name

Complexity of preemptive minsum scheduling on unrelated parallel machines.. J. Algorithms, 57 (1): 37-48 (2005)Approximability of average completion time scheduling on unrelated machines.. Math. Program., 161 (1-2): 135-158 (2017)Connected Feedback Vertex Set in Planar Graphs., and . WG, volume 5911 of Lecture Notes in Computer Science, page 143-153. (2009)Competitive analysis of preemptive single-machine scheduling.. Oper. Res. Lett., 38 (6): 585-588 (2010)A priori TSP in the scenario model., , , and . Discret. Appl. Math., (2018)A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.. Discret. Appl. Math., 92 (2-3): 243-246 (1999)Fixed-Order Scheduling on Parallel Machines., , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 88-100. Springer, (2019)Efficient Algorithms for Average Completion Time Scheduling.. IPCO, volume 6080 of Lecture Notes in Computer Science, page 411-423. Springer, (2010)The A Priori Traveling Repairman Problem., and . Algorithmica, 80 (10): 2818-2833 (2018)On the Complexity of Master Problems., and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 567-576. Springer, (2015)