( 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)

Ekkehart Renesse

Horst Renemann

Dorothea Renesse

Gerhard Renelt

 

Other publications of authors with the same name

Competitive analysis of preemptive single-machine scheduling.. Oper. Res. Lett., 38 (6): 585-588 (2010)Connected Feedback Vertex Set in Planar Graphs., and . WG, volume 5911 of Lecture Notes in Computer Science, page 143-153. (2009)The Chinese deliveryman problem., and . 4OR, 18 (3): 341-356 (2020)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)On the Complexity of Master Problems., and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 567-576. Springer, (2015)A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 451-462. Springer, (2007)The Itinerant List Update Problem., , , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 310-326. Springer, (2018)A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective., and . Oper. Res. Lett., 46 (4): 438-442 (2018)Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.. SODA, page 604-616. SIAM, (2014)