Related papers: Greedy balanced pairs in $N$-free ordered sets
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this…
Wattenhofer [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the…
For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property…
A set of vertices is $k$-sparse if it induces a graph with a maximum degree of at most $k$. In this missive, we consider the order of the largest $k$-sparse set in a triangle-free graph of fixed order. We show, for example, that every…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
In [25], T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps, with a focus on the $\mathbf n$-$t$-quasi-greedy property that is based on them. Building upon this foundation, our…
We study the greedy-based online algorithm for edge-weighted matching with (one-sided) vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was first studied more than a decade ago by Korula and P\'al for…
The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This…
Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left node is fractionally assigned to its neighbors in proportion…
In this paper we determine a class of critical sets in the abelian {2--group} that may be obtained from a greedy algorithm. These new critical sets are all 2--critical (each entry intersects an intercalate, a trade of size 4) and completes…
A connected and nonempty graph A is defined as generalized t-edge distance-balanced, while for each edge f={\alpha}\{beta} the number of edges nearer to {\alpha} than \{beta} are equal to t-times of edges nearer to \{beta} than to {\alpha},…
Let $G$ be a finite group and $N$ a proper, nontrivial, normal subgroup of $G$. If, for every element $x$ of $G$ not lying in $N$, the elements in the coset $xN$ all have the same order as $x$, then we say that $(G,N)$ is an {\it{equal…
We characterise the pairs of graphs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are perfect. Similarly, we characterise pairs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are…
We study the algorithmic problem of finding large $\gamma$-balanced independent sets in dense random bipartite graphs; an independent set is $\gamma$-balanced if a $\gamma$ proportion of its vertices lie on one side of the bipartition. In…
In many prediction problems, it is not uncommon that the number of variables used to construct a forecast is of the same order of magnitude as the sample size, if not larger. We then face the problem of constructing a prediction in the…
The online weighted matching problem is a fundamental problem in machine learning due to its numerous applications. Despite many efforts in this area, existing algorithms are either too slow or don't take $\mathrm{deadline}$ (the longest…
The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all…
We study a foundational model of dynamic matching market with abandonment. This model has been studied by Collina et al (2020) and Aouad and Saritac (2022), and many other papers have considered special cases. We compare the performance of…
The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube $[0,1]^d$. The figures of merit are three different variants of $L_2$ discrepancy. Theoretical results…
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm colours…