11 hasil untuk "Jean Cardinal"
Menampilkan 1–11 · 0,49 detik · RSS
-
Artikel Jurnal
Topological drawings of complete bipartite graphs
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been studied extensively in the context of crossing number…
-
Artikel Jurnal
Algorithms for approximate sparse regression and nearest induced hulls
The sparse regression problem, also known as best subset selection problem, can be cast as follows: Given a set $S$ of $n$ points in $\mathbb{R}^d$, a point $y\in\mathbb{R}^d$, and an integer $2 \leq k \leq d$, find an affine combination of at most $k$ points of $S$ that is nearest to $y$. We…
-
Artikel Jurnal
Randomized Optimization: a Probabilistic Analysis
In 1999, Chan proposed an algorithm to solve a given optimization problem: express the solution as the minimum of the solutions of several subproblems and apply the classical randomized algorithm for finding the minimum of $r$ numbers. If the decision versions of the subproblems are easier to solve…
-
Artikel Jurnal
A Note on Flips in Diagonal Rectangulations
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal with local changes involving a single edge of a…
-
Artikel Jurnal
Ramsey-type theorems for lines in 3-space
We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli in 3-space. Among other things, we prove that: (1) The…
-
Artikel Jurnal
On the shelling antimatroids of split graphs
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of these antimatroids, namely the split graph shelling…
-
Artikel Jurnal
Making triangles colorful
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least 144k8 points of P contains at least one of each color. This is the first polynomial bound for range spaces…
-
Artikel Jurnal
Subquadratic encodings for point configurations
For many algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation of each triple of points in the set (clockwise, counterclockwise, or collinear). This information is called the order…