Imagen de Portada

Improved Streaming Algorithm for Fair $k$-Center Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Guo, Longkun, Lin, Zeyu, Jia, Chaoqi, Chen, Chao
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
por: Antony, Dhanyamol, et al.
Publicado: (2023)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Fairness in Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2021)

Counting random $k$-SAT near the satisfiability threshold
por: Chen, Zongchen, et al.
Publicado: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
por: Xiao, Chenglong, et al.
Publicado: (2024)

Online Graph Coloring for $k$-Colorable Graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2025)

Random local access for sampling k-SAT solutions
por: Dong, Dingding, et al.
Publicado: (2024)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
por: Tan, Jingjing
Publicado: (2024)

On Tight Robust Coresets for $k$-Medians Clustering
por: Huang, Lingxiao, et al.
Publicado: (2025)

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

Algorithmic Aspects of Temporal Betweenness
por: Buß, Sebastian, et al.
Publicado: (2020)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
por: Arndt, Stephen, et al.
Publicado: (2026)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

Matching Algorithms in the Sparse Stochastic Block Model
por: Brandenberger, Anna, et al.
Publicado: (2024)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
por: Gaikwad, Ajinkya
Publicado: (2025)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
por: Ingels, Florian
Publicado: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

Algorithmic Results for Weak Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

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

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
por: Arhire, Andrei, et al.
Publicado: (2025)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
por: Abboud, Amir, et al.
Publicado: (2025)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
por: Duvignau, Romaric, et al.
Publicado: (2024)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
por: Liang, Wei, et al.
Publicado: (2024)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
por: Baswana, Surender, et al.
Publicado: (2023)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)

Deterministic counting from coupling independence
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

Approximately covering vertices by order-$5$ or longer paths
por: Gong, Mingyang, et al.
Publicado: (2024)

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
por: Brubach, Brian, et al.
Publicado: (2021)

Thin Trees via $k$-Respecting Cut Identities
por: Daga, Mohit
Publicado: (2025)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)