( en | de | ru )

 

Disambiguation of "Wiese, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

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)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)Fixed-Parameter Algorithms for Unsplittable Flow Cover., , and . STACS, volume 154 of LIPIcs, page 42:1-42:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Better Approximations for General Caching and UFP-Cover Under Resource Augmentation., and . STACS, volume 154 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Partitioned EDF scheduling on a few types of unrelated multiprocessors., , and . Real Time Syst., 49 (2): 219-238 (2013)A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes., , , and . STOC, page 607-619. ACM, (2018)Fixed-Parameter Approximation Schemes for Weighted Flowtime.. APPROX-RANDOM, volume 116 of LIPIcs, page 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)