Zobrazeno 1 - 10
of 189
pro vyhledávání: '"Harris, David G"'
Autor:
Giliberti, Jeff, Harris, David G.
One main genre of algorithmic derandomization comes from the construction of probability distributions with small support that fool a randomized algorithm. This is especially well-suited to parallelization, i.e. NC algorithms. A significant abstracti
Externí odkaz:
http://arxiv.org/abs/2411.18028
Autor:
Harris, David G.
Publikováno v:
SODA 2024
We describe a new dependent-rounding algorithmic framework for bipartite graphs. Given a fractional assignment $\vec x$ of values to edges of graph $G = (U \cup V, E)$, the algorithms return an integral solution $\vec X$ such that each right-node $v
Externí odkaz:
http://arxiv.org/abs/2308.07476
Autor:
Burkhardt, Paul, Harris, David G.
We consider the problem of counting 4-cycles ($C_4$) in an undirected graph $G$ of $n$ vertices and $m$ edges (in bipartite graphs, 4-cycles are also often referred to as $\textit{butterflies}$). Most recently, Wang et al. (2019, 2022) developed algo
Externí odkaz:
http://arxiv.org/abs/2303.06090
Autor:
Harris, David G., Narayanaswamy, N. S.
Publikováno v:
STACS 2024
We describe a new algorithm for vertex cover with runtime $O^*(1.25284^k)$, where $k$ is the size of the desired solution and $O^*$ hides polynomial factors in the input size. This improves over previous runtime of $O^*(1.2738^k)$ due to Chen, Kanj,
Externí odkaz:
http://arxiv.org/abs/2205.08022
Autor:
Harris, David G.
Publikováno v:
Algorithmica 86(9), pp. 2822-2844 (2024)
Karppa & Kaski (2019) proposed a novel ``broken" or ``opportunistic" matrix multiplication algorithm, based on a variant of Strassen's algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks. Their algo
Externí odkaz:
http://arxiv.org/abs/2109.13335
Publikováno v:
Journal of International Accounting Research. Oct2024, Vol. 23 Issue 3, p29-49. 21p.
Autor:
Bansal, Nikhil, Harris, David G.
Publikováno v:
Random Structures & Algorithms 62(1), pp. 52-67 (2023)
A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the value of an o
Externí odkaz:
http://arxiv.org/abs/2011.07097
Publikováno v:
SIAM Journal on Discrete Mathematics 37(2), pp. 800-830 (2023)
Given a graph $G=(V,E)$ with arboricity $\alpha$, we study the problem of decomposing the edges of $G$ into $(1+\epsilon)\alpha$ disjoint forests in the distributed LOCAL model. Barenboim and Elkin [PODC `08] gave a LOCAL algorithm that computes a $(
Externí odkaz:
http://arxiv.org/abs/2009.10761
Publikováno v:
RANDOM 2021
The Lov\'{a}sz Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that t
Externí odkaz:
http://arxiv.org/abs/2008.05569
Autor:
Brubach, Brian, Grammel, Nathaniel, Harris, David G., Srinivasan, Aravind, Tsepenekas, Leonidas, Vullikanti, Anil
The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint. In addition to the standard (homogeneous) se
Externí odkaz:
http://arxiv.org/abs/2008.03325