( en | de | ru )

 

Disambiguation of "Wiese, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
On the extension complexity of scheduling polytopes.

, , and . Oper. Res. Lett., 48 (4): 472-479 (2020)

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.

Andreas Wiese

Andreas Wiese

Andreas Wiese

Andreas Wiese

Andreas Wiese

 

Other publications of authors with the same name

Scheduling and Fixed-Parameter Tractability., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 381-392. Springer, (2014)Increasing Speed Scheduling and Flow Scheduling., and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 279-290. Springer, (2010)Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs., and . ADHOC-NOW, volume 5198 of Lecture Notes in Computer Science, page 1-14. Springer, (2008)Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs., and . DCOSS, volume 5067 of Lecture Notes in Computer Science, page 415-431. Springer, (2008)Packing Cars into Narrow Roads: PTASs for Limited Supply Highway., and . ESA, volume 144 of LIPIcs, page 54:1-54:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A (2+) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 973-984. Springer, (2015)Breaking the Barrier of 2 for the Storage Allocation Problem., and . CoRR, (2019)Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back., , and . ESA, volume 204 of LIPIcs, page 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Simpler QPTAS for Scheduling Jobs with Precedence Constraints., and . ESA, volume 244 of LIPIcs, page 40:1-40:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New Approximation Schemes for Unsplittable Flow on a Path., , , , and . SODA, page 47-58. SIAM, (2015)