Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Newman, Heather A."'
This paper considers correlation clustering on unweighted complete graphs. We give a combinatorial algorithm that returns a single clustering solution that is simultaneously $O(1)$-approximate for all $\ell_p$-norms of the disagreement vector; in oth
Externí odkaz:
http://arxiv.org/abs/2308.01534
We consider the online $k$-median clustering problem in which $n$ points arrive online and must be irrevocably assigned to a cluster on arrival. As there are lower bound instances that show that an online algorithm cannot achieve a competitive ratio
Externí odkaz:
http://arxiv.org/abs/2303.15379
We introduce fast algorithms for correlation clustering with respect to the Min Max objective that provide constant factor approximations on complete graphs. Our algorithms are the first purely combinatorial approximation algorithms for this problem.
Externí odkaz:
http://arxiv.org/abs/2301.13079
We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on sampling from max-entropy
Externí odkaz:
http://arxiv.org/abs/2111.09290
Autor:
Duchin, Moon, Gladkova, Taissa, Henninger-Voss, Eugene, Klingensmith, Ben, Newman, Heather, Wheelen, Hannah
Republican candidates often receive between 30 and 40 percent of the two-way vote share in statewide elections in Massachusetts. For the last three Census cycles, MA has held 9-10 seats in the House of Representatives, which means that a district can
Externí odkaz:
http://arxiv.org/abs/1810.09051
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. I
Externí odkaz:
http://arxiv.org/abs/1709.04773
Publikováno v:
Involve 12 (2019) 1329-1341
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all connected edg
Externí odkaz:
http://arxiv.org/abs/1709.04750
Autor:
Newman, Heather
Publikováno v:
PC Gamer (US Edition); Nov2024, Issue 388, p68-71, 4p, 16 Color Photographs
Publikováno v:
Mathematical Programming; Jul2024, Vol. 206 Issue 1/2, p541-576, 36p
Autor:
Newman, Heather
Publikováno v:
PC Gamer (US Edition); Jun2024, Issue 383, p68-71, 4p, 12 Color Photographs