On the \(k\)-colored rainbow sets in fixed dimensions
From MaRDI portal
Publication:2150582
DOI10.1007/978-3-030-92681-6_46OpenAlexW4205574247MaRDI QIDQ2150582
Hamidreza Keikha, Vahideh Keikha, Ali Mohades
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_46
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the parameterized complexity of multiple-interval graph problems
- Algorithms for optimal outlier removal
- The upper envelope of Voronoi surfaces and its applications
- Iterated nearest neighbors and finding minimal polytopes
- Approximation algorithms for color spanning diameter
- Maximum colorful independent sets in vertex-colored graphs
- Applications of random sampling in computational geometry. II
- On geometric optimization with few violated constraints
- Computing minimum diameter color-spanning sets is hard
- Minimum diameter color-spanning sets revisited
- On approximability of minimum color-spanning ball in high dimensions
- Largest bounding box, smallest diameter, and related problems on imprecise points
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- On some geometric problems of color-spanning sets
- Geometric Avatar Problems
- Approximating extent measures of points
- A threshold of ln n for approximating set cover
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- FINDING POPULAR PLACES
- The complexity of theorem-proving procedures
This page was built for publication: On the \(k\)-colored rainbow sets in fixed dimensions
