Imagen de Portada

Servicing Matched Client Pairs with Facilities

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abbasi, Fateme, Böhm, Martin, Byrka, Jarosław, Mohammadi, Matin, Shin, Yongho
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Chromatic correlation clustering via cluster LP
por: Abbasi, Fateme, et al.
Publicado: (2025)

Online Rounding for Set Cover under Subset Arrivals
por: Byrka, Jarosław, et al.
Publicado: (2025)

Online Disjoint Set Covers: Randomization is not Necessary
por: Bienkowski, Marcin, et al.
Publicado: (2024)

Parsimonious Learning-Augmented Online Metric Matching
por: Shin, Yongho, et al.
Publicado: (2026)

On the Bidirected Cut Relaxation for Steiner Forest
por: Byrka, Jarosław, et al.
Publicado: (2024)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
por: Byrka, Jarosław, et al.
Publicado: (2024)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
por: Abbasi, Fateme, et al.
Publicado: (2023)

$k$-Clustering via Iterative Randomized Rounding
por: Byrka, Jarosław, et al.
Publicado: (2026)

Learning-Augmented Online Bipartite Fractional Matching
por: Choo, Davin, et al.
Publicado: (2025)

Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
por: Byrka, Jarosław, et al.
Publicado: (2025)

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
por: Ansaripour, Matin, et al.
Publicado: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
por: Lee, Changyeol, et al.
Publicado: (2026)

Facility Location on High-dimensional Euclidean Spaces
por: Lee, Euiwoong, et al.
Publicado: (2025)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
por: Lee, Changyeol, et al.
Publicado: (2025)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
por: Azarmehr, Amir, et al.
Publicado: (2025)

Approximating Traveling Salesman Problems Using a Bridge Lemma
por: Böhm, Martin, et al.
Publicado: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Improved online load balancing with known makespan
por: Böhm, Martin, et al.
Publicado: (2024)

Online Facility Assignments on Polygons
por: Malik, Sumaiya, et al.
Publicado: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
por: Nägele, Martin, et al.
Publicado: (2026)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
por: Basiak, Mateusz, et al.
Publicado: (2025)

Facility Location and $k$-Median with Fair Outliers
por: Dabas, Rajni, et al.
Publicado: (2025)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

A QPTAS for Facility Location on Unit Disk graphs
por: Friggstad, Zachary, et al.
Publicado: (2024)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
por: Bernstein, Aaron, et al.
Publicado: (2024)

Semirandom Planted Clique and the Restricted Isometry Property
por: Błasiok, Jarosław, et al.
Publicado: (2024)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
por: Goranci, Gramoz, et al.
Publicado: (2025)

Greedy Dynamic Matching
por: Arnosti, Nick, et al.
Publicado: (2025)

Cartesian Forest Matching
por: Auvray, Bastien, et al.
Publicado: (2025)

Caching Connections in Matchings
por: Sadeh, Yaniv, et al.
Publicado: (2023)

Faster All-Pairs Optimal Electric Car Routing
por: Dorfman, Dani, et al.
Publicado: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2022)

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
por: Riad, Md. Rawha Siddiqi, et al.
Publicado: (2025)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
por: Dory, Michal, et al.
Publicado: (2022)

Finding Triangles or Independent Sets; and Other Dual Pair Approximations
por: Dumitrescu, Adrian
Publicado: (2021)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
por: Kikuchi, Masaru, et al.
Publicado: (2024)

All-Pairs Shortest Paths with Few Weights per Node
por: Abboud, Amir, et al.
Publicado: (2025)

Efficient and Provable Algorithms for Covariate Shift
por: Adil, Deeksha, et al.
Publicado: (2025)

Dynamic Rank, Basis, and Matching
por: Brand, Jan van den, et al.
Publicado: (2026)