Spremljaj
Waldo Gálvez
Waldo Gálvez
Assistant Professor at Institute of Engineering Sciences, Universidad de O'Higgins
Preverjeni e-poštni naslov na uoh.cl - Domača stran
Naslov
Navedeno
Navedeno
Leto
Approximating geometric knapsack via L-packings
W Gálvez, F Grandoni, S Heydrich, S Ingala, A Khan, A Wiese
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
382017
Improved pseudo-polynomial-time approximation for strip packing
W Gálvez, F Grandoni, S Ingala, A Khan
arXiv preprint arXiv:1801.07541, 2018
322018
A 3-approximation algorithm for maximum independent set of rectangles
W Gálvez, A Khan, M Mari, T Mömke, MR Pittu, A Wiese
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
312022
Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple l-shapes, spirals, and more
W Gálvez, F Grandoni, A Khan, D Ramírez-Romero, A Wiese
arXiv preprint arXiv:2103.10406, 2021
262021
A Tight -Approximation for Skewed Strip Packing
W Gálvez, F Grandoni, AJ Ameli, K Jansen, A Khan, M Rau
Algorithmica 85 (10), 3088-3109, 2023
242023
Symmetry exploitation for online machine covering with bounded migration
W Gálvez, JA Soto, J Verschae
ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020
202020
On the cycle augmentation problem: hardness and approximation algorithms
W Gálvez, F Grandoni, A Jabal Ameli, K Sornat
Theory of Computing Systems 65, 985-1008, 2021
182021
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
W Gálvez, A Khan, M Mari, T Mömke, M Reddy, A Wiese
arXiv preprint arXiv:2106.00623, 2021
182021
Approximating geometric knapsack via l-packings
W Gálvez, F Grandoni, S Ingala, S Heydrich, A Khan, A Wiese
ACM Transactions on Algorithms (TALG) 17 (4), 1-67, 2021
172021
Approximation algorithms for demand strip packing
W Gálvez, F Grandoni, AJ Ameli, K Khodamoradi
arXiv preprint arXiv:2105.08577, 2021
92021
Machine covering in the random-order model
S Albers, W Gálvez, M Janke
Algorithmica 85 (6), 1560-1585, 2023
52023
Improved online algorithms for the machine covering problem with bounded migration
W Gálvez, JA Soto, J Verschae
12th Workshop on Models and Algorithms for Planning and Scheduling Problems 21, 2015
42015
Node Connectivity Augmentation of Highly Connected Graphs
W Galvez, D Hyatt-Denesik, AJ Ameli, L Sanita
arXiv preprint arXiv:2311.17010, 2023
12023
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle
W Gálvez, F Sanhueza-Matamala, JA Soto
International Workshop on Approximation and Online Algorithms, 1-22, 2021
12021
Approximation Schemes for Packing Problems with -norm Diversity Constraints
W Gálvez, V Verdugo
Latin American Symposium on Theoretical Informatics, 204-221, 2022
2022
On the Demand Strip Packing
AJ Ameli, F Grandoni, K Khodamoradi, W Galvez
Approx, 2021
2021
Approximation algorithms for two-dimensional geometric packing problems
W Gálvez
2019
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
M Thorup, M Sagiv, H Hermanns, A Madry, FV Fomin, T Bultan, S Baruah, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016
2016
Computing Diverse and Nice Triangulations: Hardness and Algorithms
W Gálvez, M Goswami, A Merino, GB Park, MT Tsai, V Verdugo
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–19