Zobrazeno 1 - 10
of 2 465
pro vyhledávání: '"Venzin, A."'
We propose a $O(\log k \log n)$-competitive randomized algorithm for online node-weighted Steiner forest. This is essentially optimal and significantly improves over the previous bound of $O(\log^2 k \log n)$ by Hajiaghayi et al. [2017]. In fact, our
Externí odkaz:
http://arxiv.org/abs/2410.18542
Autor:
Jean-Michel Halimi, Pantelis Sarafidis, Michel Azizi, Grzegorz Bilo, Thilo Burkard, Michael Bursztyn, Miguel Camafort, Neil Chapman, Santina Cottone, Tine de Backer, Jaap Deinum, Philippe Delmotte, Maria Dorobantu, Michalis Doumas, Rainer Dusing, Béatrice Duly-Bouhanick, Jean-Pierre Fauvel, Pierre Fesler, Zbigniew Gaciong, Eugenia Gkaliagkousi, Daniel Gordin, Guido Grassi, Charalampos Grassos, Dominique Guerrot, Justine Huart, Raffaele Izzo, Fernando Jaén Águila, Zoltán Járai, Thomas Kahan, Ilkka Kantola, Eva Kociánová, FlorianP. Limbourg, Marilucy Lopez-Sublet, Francesca Mallamaci, Athanasios Manolis, Maria Marketou, Gert Mayer, Alberto Mazza, IainM. MacIntyre, Jean-Jacques Mourad, Maria Lorenza Muiesan, Edgar Nasr, Peter Nilsson, Anna Oliveras, Olivier Ormezzano, Vitor Paixão-Dias, Ioannis Papadakis, Dimitris Papadopoulos, Sabine Perl, Jorge Polónia, Roberto Pontremoli, Giacomo Pucci, Nicolás Roberto Robles, Sébastien Rubin, Luis Miguel Ruilope, Lars Christian Rump, Sahrai Saeed, Elias Sanidas, Riccardo Sarzani, Roland Schmieder, François Silhol, Sekib Sokolovic, Marit Solbu, Miroslav Soucek, George Stergiou, Isabella Sudano, Ramzi Tabbalat, Istemihan Tengiz, Helen Triantafyllidi, Konstontinos Tsioufis, Jan Václavík, Markus van der Giet, Patricia Van der Niepen, Franco Veglio, RetoM. Venzin, Margus Viigimaa, Thomas Weber, Jiri Widimsky, Gregoire Wuerzner, Parounak Zelveian, Pantelis Zebekakis, Stephan Lueders, Alexandre Persu, Reinhold Kreutz, Liffert Vogt
Publikováno v:
Blood Pressure, Vol 33, Iss 1 (2024)
Objective Real-life management of patients with hypertension and chronic kidney disease (CKD) among European Society of Hypertension Excellence Centres (ESH-ECs) is unclear : we aimed to investigate it. Methods A survey was conducted in 2023. The que
Externí odkaz:
https://doaj.org/article/c522c816726644049a1f398a156c2491
Autor:
Mélanie T. M. Hannebelle, Esther Raeth, Samuel M. Leitao, Tomáš Lukeš, Jakub Pospíšil, Chiara Toniolo, Olivier F. Venzin, Antonius Chrisnandy, Prabhu P. Swain, Nathan Ronceray, Matthias P. Lütolf, Andrew C. Oates, Guy M. Hagen, Theo Lasser, Aleksandra Radenovic, John D. McKinney, Georg E. Fantner
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-8 (2024)
Abstract Super-resolution techniques expand the abilities of researchers who have the knowledge and resources to either build or purchase a system. This excludes the part of the research community without these capabilities. Here we introduce the ope
Externí odkaz:
https://doaj.org/article/33f09367ca9c4c86ac3975ae417890f1
Autor:
Rothvoss, Thomas, Venzin, Moritz
We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time $2^{0.802\, n}$. This contrasts the corresponding $2^n$ time, (gap)-SETH based lower bounds for these problems that ev
Externí odkaz:
http://arxiv.org/abs/2110.02387
Autor:
Andreata, Francesco, Laura, Chiara, Ravà, Micol, Krueger, Caroline C., Ficht, Xenia, Kawashima, Keigo, Beccaria, Cristian G., Moalli, Federica, Partini, Bianca, Fumagalli, Valeria, Nosetto, Giulia, Di Lucia, Pietro, Montali, Ilaria, Garcia-Manteiga, José M., Bono, Elisa B., Giustini, Leonardo, Perucchini, Chiara, Venzin, Valentina, Ranucci, Serena, Inverso, Donato, De Giovanni, Marco, Genua, Marco, Ostuni, Renato, Lugli, Enrico, Isogawa, Masanori, Ferrari, Carlo, Boni, Carolina, Fisicaro, Paola, Guidotti, Luca G., Iannacone, Matteo
Publikováno v:
In Cell 25 July 2024 187(15):4078-4094
We consider the following geometric optimization problem: Given $ n $ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a rectangle if i
Externí odkaz:
http://arxiv.org/abs/2107.06571
Autor:
Cslovjecsek, Jana, Eisenbrand, Friedrich, Pilipczuk, Michał, Venzin, Moritz, Weismantel, Robert
We consider the problem of solving integer programs of the form $\min \{\,c^\intercal x\ \colon\ Ax=b, x\geq 0\}$, where $A$ is a multistage stochastic matrix in the following sense: the primal treedepth of $A$ is bounded by a parameter $d$, which me
Externí odkaz:
http://arxiv.org/abs/2012.11742
Autor:
Eisenbrand, Friedrich, Venzin, Moritz
We show that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. any $\ell_p$-norm can be computed in time $2^{(0.802 +{\epsilon})\, n}$. This matches the currently fastest constant factor approximation algorithm
Externí odkaz:
http://arxiv.org/abs/2005.04957
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Naszódi, Márton, Venzin, Moritz
We present algorithms for the $(1+\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\epsilon)^n$. We improve this s
Externí odkaz:
http://arxiv.org/abs/1908.08384