( en | de | ru )

 

Disambiguation of "Wiese, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Additive Approximation Schemes for Load Balancing Problems.

, , , and . ICALP, volume 198 of LIPIcs, page 42:1-42:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Breaking the Barrier of 2 for the Storage Allocation Problem., and . CoRR, (2019)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)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)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)Partitioned EDF scheduling on a few types of unrelated multiprocessors., , and . Real Time Syst., 49 (2): 219-238 (2013)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)Scheduling and Fixed-Parameter Tractability., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 381-392. Springer, (2014)Local algorithms for edge colorings in UDGs., , and . Theor. Comput. Sci., 412 (35): 4704-4714 (2011)Breaking symmetries to rescue sum of squares in the case of makespan scheduling., , and . Math. Program., 183 (1): 583-618 (2020)