Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Farhadi, Alireza"'
Computing the connected components of a graph is a fundamental problem in algorithmic graph theory. A major question in this area is whether we can compute connected components in $o(\log n)$ parallel time. Recent works showed an affirmative answer i
Externí odkaz:
http://arxiv.org/abs/2312.02332
Autor:
Derakhshan, Mahsa, Farhadi, Alireza
In the stochastic weighted matching problem, the goal is to find a large-weight matching of a graph when we are uncertain about the existence of its edges. In particular, each edge $e$ has a known weight $w_e$ but is realized independently with some
Externí odkaz:
http://arxiv.org/abs/2210.17515
In this paper, we generalize the recently studied Stochastic Matching problem to more accurately model a significant medical process, kidney exchange, and several other applications. Up until now the Stochastic Matching problem that has been studied
Externí odkaz:
http://arxiv.org/abs/2205.14717
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are $\textit{reusable}$. In particular, when a resource is matched to an online vertex it is unavailable for a deterministic time duration $d$ af
Externí odkaz:
http://arxiv.org/abs/2110.07084
Given a graph, the densest subgraph problem asks for a set of vertices such that the average degree among these vertices is maximized. Densest subgraph has numerous applications in learning, e.g., community detection in social networks, link spam det
Externí odkaz:
http://arxiv.org/abs/2106.00508
Autor:
Farhadi, Alireza, Hajiaghayi, MohammadTaghi, Latifian, Mohamad, Seddighin, Masoud, Yami, Hadi
Envy-free up to one good (EF1) and envy-free up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contras
Externí odkaz:
http://arxiv.org/abs/2007.07027
The edit distance (ED) and longest common subsequence (LCS) are two fundamental problems which quantify how similar two strings are to one another. In this paper, we consider these problems in the asymmetric streaming model introduced by Andoni et al
Externí odkaz:
http://arxiv.org/abs/2002.11342
In this paper, we study the problem of finding a maximum matching in the semi-streaming model when edges arrive in a random order. In the semi-streaming model, an algorithm receives a stream of edges and it is allowed to have a memory of $\tilde{O}(n
Externí odkaz:
http://arxiv.org/abs/1912.10497
The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation factor $2-\
Externí odkaz:
http://arxiv.org/abs/1811.04052
We consider the following stochastic matching problem on both weighted and unweighted graphs: A graph $G(V, E)$ along with a parameter $p \in (0, 1)$ is given in the input. Each edge of $G$ is realized independently with probability $p$. The goal is
Externí odkaz:
http://arxiv.org/abs/1811.03224