Image de couverture de livre

Hybrid k-Clustering: Blending k-Median and k-Center

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
par: Gadekar, Ameet, et autres
Publié: (2025)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

On Tight Robust Coresets for $k$-Medians Clustering
par: Huang, Lingxiao, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Fixed-Parameter Tractability of Hedge Cut
par: Fomin, Fedor V., et autres
Publié: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

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

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
par: Huang, Lingxiao, et autres
Publié: (2022)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

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

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

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

Fine-Grained Complexity of Continuous Euclidean k-Center
par: Blank, Lotte, et autres
Publié: (2026)

Top-k Stabbing Interval Queries
par: Akram, Waseem, et autres
Publié: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
par: Funk, Nicole, et autres
Publié: (2026)

Algorithmic Extensions of Dirac's Theorem
par: Fomin, Fedor V., et autres
Publié: (2020)

Efficient Enumeration of At Most $k$-Out Polygons
par: Akram, Waseem, et autres
Publié: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
par: van Wijland, Ernest, et autres
Publié: (2023)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering
par: Manthey, Bodo, et autres
Publié: (2023)

Deterministic $k$-Median Clustering in Near-Optimal Time
par: Costa, Martín, et autres
Publié: (2025)

Connected k-Median with Disjoint and Non-disjoint Clusters
par: Eube, Jan, et autres
Publié: (2025)

Packing Short Cycles
par: Bentert, Matthias, et autres
Publié: (2024)

Performance bounds for nearest neighbor search with k-d trees
par: Bazzani, Marco, et autres
Publié: (2026)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
par: Lokshtanov, Daniel, et autres
Publié: (2024)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

On Parallel $k$-Center Clustering
par: Coy, Sam, et autres
Publié: (2023)

Average Sensitivity of Hierarchical $k$-Median Clustering
par: Li, Shijie, et autres
Publié: (2025)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)