Image de couverture de livre

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chung, Chaeyoon, Maheshwari, Anil, Smid, Michiel
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Euclidean Maximum Matchings in the Plane---Local to Global
par: Biniaz, Ahmad, et autres
Publié: (2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
par: Biniaz, Ahmad, et autres
Publié: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
par: Biniaz, Ahmad, et autres
Publié: (2025)

Polychromatic Coloring of Tuples in Hypergraphs
par: Biniaz, Ahmad, et autres
Publié: (2025)

Computing Oriented Spanners and their Dilation
par: Buchin, Kevin, et autres
Publié: (2024)

Constrained Two-Line Center Problems
par: Ahn, Taehoon, et autres
Publié: (2024)

Online Class Cover Problem
par: De, Minati, et autres
Publié: (2023)

Optimal Algorithm for the Planar Two-Center Problem
par: Cho, Kyungjin, et autres
Publié: (2020)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
par: Har-Peled, Sariel, et autres
Publié: (2014)

On Stable Approximation Algorithms for Geometric Coverage Problems
par: de Berg, Mark, et autres
Publié: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

Completely Independent Steiner Trees
par: Maheshwari, Anil, et autres
Publié: (2026)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
par: Chan, Timothy M., et autres
Publié: (2025)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
par: Dutta, Madhura, et autres
Publié: (2025)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
par: Lynch, Jayson, et autres
Publié: (2025)

Computing shortest paths amid non-overlapping weighted disks
par: Bose, Prosenjit, et autres
Publié: (2024)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
par: Zhao, Lei, et autres
Publié: (2024)

Contiguous Boundary Guarding
par: Biniaz, Ahmad, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
par: Sanim, Md. Musfiqur Rahman, et autres
Publié: (2024)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
par: Gibor, Daniel
Publié: (2025)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
par: Chandran, L. Sunil, et autres
Publié: (2024)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
par: Kar, Debajyoti, et autres
Publié: (2026)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Approximation Algorithms for Anchored Multiwatchman Routes
par: Mitchell, Joseph S. B., et autres
Publié: (2024)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
par: Stojanović, Vanja, et autres
Publié: (2025)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
par: Chung, Jaehoon
Publié: (2026)

An Optimal Algorithm for Computing Many Faces in Line Arrangements
par: Wang, Haitao
Publié: (2026)

Fast Approximation Algorithms for Piercing Boxes by Points
par: Agarwal, Pankaj K., et autres
Publié: (2023)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
par: Zhou, Yi, et autres
Publié: (2026)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
par: Gao, Jie, et autres
Publié: (2025)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
par: Aichholzer, Oswin, et autres
Publié: (2025)

An Improved Bound for Plane Covering Paths
par: Akitaya, Hugo A., et autres
Publié: (2025)

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
par: Park, Eunku
Publié: (2026)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
par: Bhore, Sujoy, et autres
Publié: (2024)

Maximum-Weight Two Boxes Symmetric Difference Problem
par: Goycoolea, José Fernández, et autres
Publié: (2026)

Geometry-based Multi-beam Survey Line Layout Problem
par: Li, Chuangqi, et autres
Publié: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)