Geometric Bipartite Matching Based Exact Algorithms for Server Problems
Fuente:
arXiv
Saved in:
| Main Authors: | Raghvendra, Sharath, Shirzadian, Pouyan, Sowle, Rachita |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A New Robust Partial $p$-Wasserstein-Based Metric for Comparing Distributions
by: Raghvendra, Sharath, et al.
Published: (2024)
by: Raghvendra, Sharath, et al.
Published: (2024)
Geometric Bipartite Matching is in NC
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)
by: de Berg, Mark, et al.
Published: (2024)
Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)
by: Jain, Naman
Published: (2024)
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)
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
Exact Algorithms for Minimum Dilation Triangulation
by: Fekete, Sándor P., et al.
Published: (2025)
by: Fekete, Sándor P., et al.
Published: (2025)
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)
by: Park, Seongbin, et al.
Published: (2026)
Fully Dynamic Geometric Vertex Cover and Matching
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025)
by: Marin, Malory, et al.
Published: (2025)
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
by: Dhar, Anubhav, et al.
Published: (2024)
by: Dhar, Anubhav, 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)
A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
by: Zhuang, Qianwei
Published: (2025)
by: Zhuang, Qianwei
Published: (2025)
Exact Algorithms for Clustered Planarity with Linear Saturators
by: Da Lozzo, Giordano, et al.
Published: (2024)
by: Da Lozzo, Giordano, et al.
Published: (2024)
Optimal Algorithm for the Planar Two-Center Problem
by: Cho, Kyungjin, et al.
Published: (2020)
by: Cho, Kyungjin, et al.
Published: (2020)
On a Geometric Interpretation Of the Subset Sum Problem
by: Costandin, Marius
Published: (2024)
by: Costandin, Marius
Published: (2024)
Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
Bipartite Exact Matching in P
by: Du, Yuefeng
Published: (2026)
by: Du, Yuefeng
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)
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)
by: De, Minati, et al.
Published: (2026)
On connections between k-coloring and Euclidean k-means
by: Aman, Enver, et al.
Published: (2024)
by: Aman, Enver, et al.
Published: (2024)
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
by: Chan, Timothy M., et al.
Published: (2025)
by: Chan, Timothy M., et al.
Published: (2025)
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)
Spherical Geometrical Bases of Spherical Origami
by: Yoshino, Takashi
Published: (2026)
by: Yoshino, Takashi
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)
Two Online Map Matching Algorithms Based on Analytic Hierarchy Process and Fuzzy Logic
by: Lin, Jeremy J., et al.
Published: (2024)
by: Lin, Jeremy J., et al.
Published: (2024)
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)
A Geometric Algorithm for Blood Vessel Reconstruction from Skeletal Representation
by: Zhang, Guoqing, et al.
Published: (2024)
by: Zhang, Guoqing, et al.
Published: (2024)
An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)
by: Wang, Haitao, et al.
Published: (2024)
Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
by: Liu, Gang, et al.
Published: (2024)
by: Liu, Gang, et al.
Published: (2024)
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
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)
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)
by: Wang, Haitao, et al.
Published: (2023)
Algorithms for the Shortest Vector Problem in $2$-dimensional Lattices, Revisited
by: Zhao, Lihao, et al.
Published: (2025)
by: Zhao, Lihao, et al.
Published: (2025)
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)
Similar Items
-
A New Robust Partial $p$-Wasserstein-Based Metric for Comparing Distributions
by: Raghvendra, Sharath, et al.
Published: (2024) -
Geometric Bipartite Matching is in NC
by: Bhore, Sujoy, et al.
Published: (2024) -
On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024) -
Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024) -
New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
by: De, Minati, et al.
Published: (2024)