Imagen de Portada

New Algorithms and Hardness Results for Connected Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Eube, Jan, Röglin, Heiko
Formato:	Preprint
Publicado:	2025
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

Connected k-Median with Disjoint and Non-disjoint Clusters
por: Eube, Jan, et al.
Publicado: (2025)

Effective Traveling for Metric Instances of the Traveling Thief Problem
por: Eube, Jan, et al.
Publicado: (2026)

Parameterized Algorithms for Computing Pareto Sets
por: Könen, Joshua, et al.
Publicado: (2025)

Parameterized Algorithms for the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2026)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
por: Kaul, Matthias, et al.
Publicado: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
por: Madani, Amirali, et al.
Publicado: (2025)

The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
por: Nikoleit, Henri, et al.
Publicado: (2026)

Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements
por: Yamano, Ryosuke, et al.
Publicado: (2026)

Hardness and Algorithmic Results for Roman \{3\}-Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

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

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
por: Schlöter, Jens
Publicado: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
por: Sharma, Eklavya
Publicado: (2025)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
por: Hathcock, Daniel, et al.
Publicado: (2023)

Engineering Weighted Connectivity Augmentation Algorithms
por: Faraj, Marcelo Fonseca, et al.
Publicado: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
por: Das, Rathish, et al.
Publicado: (2025)

Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall
por: Koo, Jaehyun
Publicado: (2024)

Creating Robust and Fair Graph Structures for Connectivity and Clustering
por: Chatterjee, Kushagra
Publicado: (2026)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
por: Albers, Susanne, et al.
Publicado: (2025)

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
por: Jiang, Yonggang, et al.
Publicado: (2025)

Correlation Clustering Beyond the Pivot Algorithm
por: Behnezhad, Soheil, et al.
Publicado: (2024)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

A Faster Algorithm for Constrained Correlation Clustering
por: Fischer, Nick, et al.
Publicado: (2025)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

Improved Algorithms for Clustering with Noisy Distance Oracles
por: Pradhan, Pinki, et al.
Publicado: (2026)

A Simple Algorithm for Clustering Discrete Distributions
por: Mitra, Pradipta
Publicado: (2026)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
por: Cervenjak, Philip, et al.
Publicado: (2026)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
por: D'Angelo, Gianlorenzo, et al.
Publicado: (2025)

Hardness Results on Characteristics for Elastic-Degenerated Strings
por: Köppl, Dominik, et al.
Publicado: (2024)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
por: Zhou, Jianqi, et al.
Publicado: (2025)

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
por: Peng, Pan, et al.
Publicado: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
por: Dai, Han, et al.
Publicado: (2025)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)