Imagen de Portada

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Csikós, Mónika, Louvet, Alexandre, Mustafa, Nabil
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Greedy Monochromatic Island Partitions
por: Broek, Steven van den, et al.
Publicado: (2024)

Outperforming the Best 1D Low-Discrepancy Constructions with a Greedy Algorithm
por: Clément, François
Publicado: (2024)

Simple Construction of Greedy Trees and Greedy Permutations
por: Chubet, Oliver, et al.
Publicado: (2024)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
por: Biedl, Therese, et al.
Publicado: (2024)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
por: Chung, Jaehoon
Publicado: (2026)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

Greedy Routing Reachability Games
por: Lenzner, Pascal, et al.
Publicado: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
por: De, Minati, et al.
Publicado: (2024)

No-dimensional Tverberg Partitions Revisited
por: Har-Peled, Sariel, et al.
Publicado: (2023)

Error Resilient Space Partitioning
por: Dunkelman, Orr, et al.
Publicado: (2020)

Partitioning a Polygon Into Small Pieces
por: Abrahamsen, Mikkel, et al.
Publicado: (2022)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Covering and Partitioning Complex Objects with Small Pieces
por: Aamand, Anders, et al.
Publicado: (2026)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
por: Aichholzer, Oswin, et al.
Publicado: (2025)

An Optimal Algorithm for Half-plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Minimum Partition of Polygons under Width and Cut Constraints
por: Chung, Jaehoon, et al.
Publicado: (2025)

Minimum Star Partitions of Simple Polygons in Polynomial Time
por: Abrahamsen, Mikkel, et al.
Publicado: (2023)

Classification of Certain Rational Isoparametric Functions on Damek-Ricci Spaces
por: Csikós, Balázs, et al.
Publicado: (2025)

Sphere-like isoparametric hypersurfaces in Damek-Ricci spaces
por: Csikós, Balázs, et al.
Publicado: (2024)

BlockSets: A Structured Visualization for Sets with Large Elements
por: Novakova, Neda, et al.
Publicado: (2025)

Partitioning Theorems for Sets of Semi-Pfaffian Sets, with Applications
por: Lotz, Martin, et al.
Publicado: (2024)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
por: Damian, Mirela, et al.
Publicado: (2003)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
por: Bui, Hong Duc
Publicado: (2025)

Deciding Connectivity in Symmetric Semi-Algebraic Sets
por: Riener, Cordian., et al.
Publicado: (2025)

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
por: Aronov, Boris, et al.
Publicado: (2019)

Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
por: Agarwal, Pankaj K., et al.
Publicado: (2024)

Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
por: Leykin, Anton, et al.
Publicado: (2005)

Tracking Low-Level Cloud Systems with Topology
por: Li, Mingzhe, et al.
Publicado: (2025)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
por: Werner, Peter, et al.
Publicado: (2023)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
por: Spalding-Jamieson, Jack
Publicado: (2025)

On the $\ell_0$ Isoperimetric Coefficient of Measurable Sets
por: Fernandez V, Manuel
Publicado: (2023)

A Deterministic Partition Tree and Applications
por: Wang, Haitao
Publicado: (2025)

Translational Aperiodic Sets of 7 Polyominoes
por: Yang, Chao, et al.
Publicado: (2024)

Minimum Membership Geometric Set Cover in the Continuous Setting
por: Govindarajan, Sathish, et al.
Publicado: (2025)

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection
por: Clément, François, et al.
Publicado: (2023)

Marginal Independence and Partial Set Partitions
por: Ponce-Carrión, Francisco, et al.
Publicado: (2024)