Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kyriakos Axiotis"'
We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over the $\wideti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::564eb592f9766c1c6ad48746556370b3
http://arxiv.org/abs/2111.10368
http://arxiv.org/abs/2111.10368
Autor:
Vasileios Nakos, Arturs Backurs, Hongxun Wu, Karl Bringmann, Ce Jin, Kyriakos Axiotis, Christos Tzamos
Publikováno v:
SOSA
We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$ for some given integer $m$. A series of recent works has provided near-optimal algorithms for this problem under the Strong Exponential Time Hypothesis. Koiliaris and Xu (S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::514cd34769df4216b27fc749a892ea2c
https://doi.org/10.1137/1.9781611976496.6
https://doi.org/10.1137/1.9781611976496.6
Publikováno v:
FOCS
We present an $m^{4/3+o(1)}\log W$-time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight. For sparse graphs, this improves over the best known running time fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f630775494bb8e8e0df3d73bb5dd930
http://arxiv.org/abs/2003.04863
http://arxiv.org/abs/2003.04863
Publikováno v:
Panhellenic Conference on Informatics
Current trends in VLSI designs necessitate low power during both normal system operation and testing activity. Traditional Built-in Self Test (BIST) generators rise unnaturally the power consumption during testing, boosting the need to add low-power
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a236c921b8245f69374a246d7c574ff4
https://doi.org/10.1109/pci.2012.75
https://doi.org/10.1109/pci.2012.75
