Saved in:
| Main Author: | Tang, Justine |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.16710 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)
by: Kupperschmitt, Maël, et al.
Published: (2025)
Hologram Reasoning for Solving Algebra Problems with Geometry Diagrams
by: Huang, Litian, et al.
Published: (2024)
by: Huang, Litian, et al.
Published: (2024)
Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)
by: De, Minati, et al.
Published: (2023)
Product Range Search Problem
by: Chubet, Oliver, et al.
Published: (2026)
by: Chubet, Oliver, et al.
Published: (2026)
On Fréchet Traveling Salesmen Problems
by: Filtser, Omrit, et al.
Published: (2026)
by: Filtser, Omrit, et al.
Published: (2026)
Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
Constrained Two-Line Center Problems
by: Ahn, Taehoon, et al.
Published: (2024)
by: Ahn, Taehoon, et al.
Published: (2024)
Colored Points Traveling Salesman Problem
by: Asaeedi, Saeed
Published: (2024)
by: Asaeedi, Saeed
Published: (2024)
Ten Problems in Geobotics
by: Abrahamsen, Mikkel, et al.
Published: (2024)
by: Abrahamsen, Mikkel, et al.
Published: (2024)
The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)
Coresets for Farthest Point Problems in Hyperbolic Space
by: Park, Eunku, et al.
Published: (2025)
by: Park, Eunku, et al.
Published: (2025)
Asymmetric Separation Problem for Bichromatic Point Set
by: Maji, Sukanya, et al.
Published: (2024)
by: Maji, Sukanya, et al.
Published: (2024)
The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)
by: Alsaedi, Rusul J., et al.
Published: (2022)
Optimal Algorithm for the Planar Two-Center Problem
by: Cho, Kyungjin, et al.
Published: (2020)
by: Cho, Kyungjin, et al.
Published: (2020)
On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)
by: de Berg, Mark, et al.
Published: (2024)
The Contiguous Art Gallery Problem is Solvable in Polynomial Time
by: Merrild, Magnus Christian Ring, et al.
Published: (2024)
by: Merrild, Magnus Christian Ring, et al.
Published: (2024)
Maximum-Weight Two Boxes Symmetric Difference Problem
by: Goycoolea, José Fernández, et al.
Published: (2026)
by: Goycoolea, José Fernández, et al.
Published: (2026)
Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
Geometric Bipartite Matching Based Exact Algorithms for Server Problems
by: Raghvendra, Sharath, et al.
Published: (2025)
by: Raghvendra, Sharath, et al.
Published: (2025)
Segment Intersection Representations, Level Planarity and Constrained Ordering Problems
by: Fink, Simon D., et al.
Published: (2025)
by: Fink, Simon D., et al.
Published: (2025)
Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026)
by: Jana, Satyabrata, et al.
Published: (2026)
New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
by: De, Minati, et al.
Published: (2024)
by: De, Minati, et al.
Published: (2024)
The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
by: Stade, Jack
Published: (2022)
by: Stade, Jack
Published: (2022)
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)
by: Har-Peled, Sariel, et al.
Published: (2014)
Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
A Fast Quasi-Linear Heuristic for the Close-Enough Traveling Salesman Problem
by: Duong, Khoi
Published: (2026)
by: Duong, Khoi
Published: (2026)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
by: Agarwal, Pankaj K., et al.
Published: (2022)
by: Agarwal, Pankaj K., et al.
Published: (2022)
Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)
by: Zhao, Lei, et al.
Published: (2024)
Solving Euclidean Problems by Isotropic Initialization
by: Yorov, Khusrav, et al.
Published: (2025)
by: Yorov, Khusrav, et al.
Published: (2025)
Dominance for Containment Problems
by: Akram, Waseem, et al.
Published: (2022)
by: Akram, Waseem, et al.
Published: (2022)
The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
by: Sukkasem, Phapaengmuang, et al.
Published: (2025)
by: Sukkasem, Phapaengmuang, et al.
Published: (2025)
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)
by: Robson, Eliot W., et al.
Published: (2024)
Determination Problems for Orbit Closures and Matrix Groups
by: Manssour, Rida Ait El, et al.
Published: (2024)
by: Manssour, Rida Ait El, et al.
Published: (2024)
On a Geometric Interpretation Of the Subset Sum Problem
by: Costandin, Marius
Published: (2024)
by: Costandin, Marius
Published: (2024)
MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)
by: Zhou, Yi, et al.
Published: (2026)
Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)
by: Tkachenko, Anastasiia, et al.
Published: (2024)
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
by: Meijer, Lucas, et al.
Published: (2026)
by: Meijer, Lucas, et al.
Published: (2026)
Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
Similar Items
-
On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025) -
Hologram Reasoning for Solving Algebra Problems with Geometry Diagrams
by: Huang, Litian, et al.
Published: (2024) -
Online Class Cover Problem
by: De, Minati, et al.
Published: (2023) -
Product Range Search Problem
by: Chubet, Oliver, et al.
Published: (2026) -
On Fréchet Traveling Salesmen Problems
by: Filtser, Omrit, et al.
Published: (2026)