Image de couverture de livre

Geometric Bipartite Matching Based Exact Algorithms for Server Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Raghvendra, Sharath, Shirzadian, Pouyan, Sowle, Rachita
Format:	Preprint
Publié:	2025
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

A New Robust Partial $p$-Wasserstein-Based Metric for Comparing Distributions
par: Raghvendra, Sharath, et autres
Publié: (2024)

Geometric Bipartite Matching is in NC
par: Bhore, Sujoy, et autres
Publié: (2024)

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

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
par: Jain, Naman
Publié: (2024)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
par: De, Minati, et autres
Publié: (2024)

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

Exact solutions to the Weighted Region Problem
par: de Berg, Sarita, et autres
Publié: (2024)

Exact Algorithms for Minimum Dilation Triangulation
par: Fekete, Sándor P., et autres
Publié: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

Fully Dynamic Geometric Vertex Cover and Matching
par: Bhore, Sujoy, et autres
Publié: (2024)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
par: Dhar, Anubhav, et autres
Publié: (2024)

The Euclidean $k$-Matching Problem is NP-hard
par: Díaz-Báñez, José-Miguel, et autres
Publié: (2025)

A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
par: Zhuang, Qianwei
Publié: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

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

On a Geometric Interpretation Of the Subset Sum Problem
par: Costandin, Marius
Publié: (2024)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

Bipartite Exact Matching in P
par: Du, Yuefeng
Publié: (2026)

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

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

On connections between k-coloring and Euclidean k-means
par: Aman, Enver, et autres
Publié: (2024)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

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

Spherical Geometrical Bases of Spherical Origami
par: Yoshino, Takashi
Publié: (2026)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
par: Chung, Chaeyoon, et autres
Publié: (2026)

Two Online Map Matching Algorithms Based on Analytic Hierarchy Process and Fuzzy Logic
par: Lin, Jeremy J., 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)

A Geometric Algorithm for Blood Vessel Reconstruction from Skeletal Representation
par: Zhang, Guoqing, et autres
Publié: (2024)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Algorithms for Halfplane Coverage and Related Problems
par: Wang, Haitao, et autres
Publié: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
par: Bose, Prosenjit, et autres
Publié: (2023)

An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
par: Sukkasem, Phapaengmuang, et autres
Publié: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

Algorithms for the Shortest Vector Problem in $2$-dimensional Lattices, Revisited
par: Zhao, Lihao, et autres
Publié: (2025)

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