Zobrazeno 1 - 10
of 6 188
pro vyhledávání: '"D. Ellis"'
Autor:
Hershkowitz, D Ellis, Huang, Richard Z
In the length-constrained minimum spanning tree (MST) problem, we are given an $n$-node edge-weighted graph $G$ and a length constraint $h \geq 1$. Our goal is to find a spanning tree of $G$ whose diameter is at most $h$ with minimum weight. Prior wo
Externí odkaz:
http://arxiv.org/abs/2410.08170
We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering the infamous
Externí odkaz:
http://arxiv.org/abs/2406.14384
Autor:
Bateni, MohammadHossein, Dhulipala, Laxman, Fletcher, Willem, Gowda, Kishen N, Hershkowitz, D Ellis, Jayaram, Rajesh, Łącki, Jakub
We give an efficient algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new Centroid-Linkage HAC algorithm with
Externí odkaz:
http://arxiv.org/abs/2406.05066
Autor:
Bateni, MohammadHossein, Dhulipala, Laxman, Gowda, Kishen N, Hershkowitz, D Ellis, Jayaram, Rajesh, Łącki, Jakub
Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and applied method for hierarchical clustering. Recent applications to massive datasets have driven significant interest in near-linear-time and efficient parallel
Externí odkaz:
http://arxiv.org/abs/2404.14730
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances and costs.
Externí odkaz:
http://arxiv.org/abs/2404.13446
We give a poly-time algorithm for the $k$-edge-connected spanning subgraph ($k$-ECSS) problem that returns a solution of cost no greater than the cheapest $(k+10)$-ECSS on the same graph. Our approach enhances the iterative relaxation framework with
Externí odkaz:
http://arxiv.org/abs/2311.09941
Autor:
Busch, Costas, Chen, Da Qi, Filtser, Arnold, Hathcock, Daniel, Hershkowitz, D Ellis, Rajaraman, Rajmohan
A spanning tree $T$ of graph $G$ is a $\rho$-approximate universal Steiner tree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing $r$, the cost of the minimal subgraph of $T$ connecting $S$ is within a $\rho$ factor of the minim
Externí odkaz:
http://arxiv.org/abs/2308.01199
A $t$-spanner of a graph is a subgraph that $t$-approximates pairwise distances. The greedy algorithm is one of the simplest and most well-studied algorithms for constructing a sparse spanner: it computes a $t$-spanner with $n^{1+O(1/t)}$ edges by re
Externí odkaz:
http://arxiv.org/abs/2304.08892
Publikováno v:
Continence, Vol 12, Iss , Pp 101710- (2024)
Aims:: To better understand Fowler’s syndrome from a patient perspective. Methods:: The survey was created by the Fowler’s syndrome UK charity(FSUK, registered charity number 1196903), and advertised to patients with a diagnosis of Fowler’s syn
Externí odkaz:
https://doaj.org/article/625614e54b9f4394b7aeb2aca7f76af2
Publikováno v:
PeerJ, Vol 12, p e17852 (2024)
The Norway lobster (Nephrops norvegicus) is one of the most important decapod crustacean seafood species in the Adriatic Sea. Previous research has identified significant differences in growth rates and maturation timing of Nephrops in the Pomo/Jabuk
Externí odkaz:
https://doaj.org/article/6720a441fef74ceda1057075fab0ca95