Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Lovett, Antonio Molina"'
In this paper, we study max-weight stochastic matchings on online bipartite graphs under both vertex and edge arrivals. We focus on designing polynomial time approximation algorithms with respect to the online benchmark, which was first considered by
Externí odkaz:
http://arxiv.org/abs/2206.01270
Autor:
Clokie, Trevor, Lidbetter, Thomas F., Lovett, Antonio Molina, Shallit, Jeffrey, Witzman, Leon
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy numbers. We
Externí odkaz:
http://arxiv.org/abs/2002.02731
We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that $2$-respects (cuts two edges of) a spanning tree $T$ of a graph $G$. This procedure can be used in place of the complicated subr
Externí odkaz:
http://arxiv.org/abs/1908.11829
The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length of $R_n$,
Externí odkaz:
http://arxiv.org/abs/1812.06347
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.