Related papers: A greedy maximal sweepline algorithm for a Jordan …
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an $[(1-1/e)\OPT-\epsilon]$ guarantee when the function is monotone and…
This paper studies hyperelliptic curves $\cH_d$ corresponding to $y^2=\varphi_d(x)$ over finite fields, with $\varphi_d(x)$ a Chebyshev polynomial. Starting from the case where $d=\ell$ is an odd prime number, new cases $(d,q)$ are…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
We present a randomized algorithm that, given a constant $\epsilon > 0$, outputs a proper $(1+\epsilon)\Delta$-edge-coloring of an $m$-edge simple graph $G$ of maximum degree $\Delta \geq 1/\epsilon$ in $O(m)$ time with high probability.…
We consider Jordan curves of the form $\gamma=\cup_{j=1}^n \gamma_j$ on the Riemann sphere for which each $\gamma_j$ is a hyperbolic geodesic in $(\widehat{\mathbb C} \smallsetminus \gamma)\cup \gamma_j$. These Jordan curves are…
We construct a Jordan curve $\Gamma \subset \mathbb{C}$ so that for any rectifiable arc $\sigma$ with endpoints in distinct complementary components of $\Gamma$, $H^1(\sigma \cap \Gamma) > 0$.
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…
We analyze a random greedy process to construct $q$-uniform linear hypergraphs using the differential equation method. We show for $q=o(\sqrt{\log n})$, that this process yields a hypergraph with $\frac{n(n-1)}{q(q-1)}(1-o(1))$ edges. We…
We consider polynomials that are orthogonal over an analytic Jordan curve L with respect to a positive analytic weight, and show that each such polynomial of sufficiently large degree can be expanded in a series of certain integral…
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal'…
Consider a channel with a given input distribution. Our aim is to degrade it to a channel with at most L output letters. One such degradation method is the so called "greedy-merge" algorithm. We derive an upper bound on the reduction in…
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
Vizing's celebrated theorem asserts that any graph of maximum degree $\Delta$ admits an edge coloring using at most $\Delta+1$ colors. In contrast, Bar-Noy, Naor and Motwani showed over a quarter century that the trivial greedy algorithm,…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy…
For any positive integers $h\ge 2$ and $g\ge 1$, we present a greedy algorithm that provides an infinite $B_h[g]$ sequence with $a_n\le 2gn^{h+(h-1)/g}.$
We consider the influence maximization problem (selecting $k$ seeds in a network maximizing the expected total influence) on undirected graphs under the linear threshold model. On the one hand, we prove that the greedy algorithm always…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph $G(V,E)$ are revealed in a streaming fashion. We analyze a variant of the previously best-known…
The greedy algorithm A iterates over a set of uniformly sized independent sets of a given graph G and checks for each set S which non-neighbor of S, if any, is best suited to be added to S, until no more suitable non-neighbors are found for…