Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Waldo Gálvez"'
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64f470f22b1521685b51b42231418a02
https://doi.org/10.1007/s00453-023-01130-2
https://doi.org/10.1007/s00453-023-01130-2
Autor:
Waldo Gálvez, Víctor Verdugo
Publikováno v:
LATIN 2022: Theoretical Informatics ISBN: 9783031206238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1e6a821e1b741505bd23d175a7deefe
https://doi.org/10.1007/978-3-031-20624-5_13
https://doi.org/10.1007/978-3-031-20624-5_13
Publikováno v:
Theory of Computing Systems.
In the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum size whose addition to the graph makes it (k + 1)-edge-connected. There is an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ff923f3063dac88a8c1031081f69e8b
https://doi.org/10.1007/s00224-020-10025-6
https://doi.org/10.1007/s00224-020-10025-6
In the Online Machine Covering problem jobs, defined by their sizes, arrive one by one and have to be assigned to m parallel and identical machines, with the goal of maximizing the load of the least-loaded machine. Unfortunately, the classical model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b64ad7da82df5b51d93ab1dac184239
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030927011
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::871a337de6c722613189cea912148144
https://doi.org/10.1007/978-3-030-92702-8_1
https://doi.org/10.1007/978-3-030-92702-8_1
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030394783
WAOA
WAOA
In the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum cardinality whose addition to the graph makes it \((k+1)\)-edge-connected. Ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96ccfe1f17dd1c47288e336df2616bcd
https://doi.org/10.1007/978-3-030-39479-0_10
https://doi.org/10.1007/978-3-030-39479-0_10
Online models that allow recourse are highly effective in situations where classical models are too pessimistic. One such problem is the online machine covering problem on identical machines. In this setting, jobs arrive one by one and must be assign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebd101a35c85a6df60760fcab2046452
Autor:
Salvatore Ingala, Andreas Wiese, Arindam Khan, Fabrizio Grandoni, Waldo Gálvez, Sandy Heydrich
Publikováno v:
Vrije Universiteit Amsterdam
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
FOCS
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
FOCS
We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9fc18eed7ba97d4dbd66f712b887ee5
https://research.vu.nl/en/publications/8d5214a8-83d6-4d57-8dc1-69f8c189331d
https://research.vu.nl/en/publications/8d5214a8-83d6-4d57-8dc1-69f8c189331d