:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Chatterjee, Kushagra
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2605.20897
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Fair Representation: Clustering and Consensus
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

Fair Correlation Clustering Meets Graph Parameters
por: Blaha, Johannes, et al.
Publicado: (2026)

Fair Center Clustering in Sliding Windows
por: Ceccarello, Matteo, et al.
Publicado: (2025)

Fair Clustering in the Sliding Window Model
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Individual Fairness in Graph Decomposition
por: Munagala, Kamesh, et al.
Publicado: (2024)

Local Search-based Individually Fair Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2025)

New Algorithms and Hardness Results for Connected Clustering
por: Eube, Jan, et al.
Publicado: (2025)

Temporal Graph Reconfiguration for Always-Connected Graphs
por: Sievers, Paul, et al.
Publicado: (2025)

Relative Error Fair Clustering in the Weak-Strong Oracle Model
por: Braverman, Vladimir, et al.
Publicado: (2025)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
por: Nezhad, Sina Bagheri, et al.
Publicado: (2025)

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

Exploration of Always $S$-Connected Temporal Graphs
por: Adamson, Duncan, et al.
Publicado: (2026)

Connectivity Labeling in Faulty Colored Graphs
por: Petruschka, Asaf, et al.
Publicado: (2024)

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

Modification-Fair Cluster Editing
por: Froese, Vincent, et al.
Publicado: (2021)

Graph Reconstruction with a Connected Components Oracle
por: Harviainen, Juha, et al.
Publicado: (2025)

Connectivity-Preserving Minimum Separator in AT-free Graphs
por: Kenig, Batya
Publicado: (2025)

Graph Traversal via Connected Mobile Agents
por: Jana, Saswata, et al.
Publicado: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
por: Neuwohner, Meike, et al.
Publicado: (2025)

Cluster Vertex Deletion on Chordal Graphs
por: Cao, Yixin, et al.
Publicado: (2026)

The Connected k-Vertex One-Center Problem on Graphs
por: Zhang, Jingru
Publicado: (2024)

Realization of Temporally Connected Graphs Based on Degree Sequences
por: Casteigts, Arnaud, et al.
Publicado: (2025)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
por: Garg, Kushagra, et al.
Publicado: (2025)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
por: Fischer, Olivier, et al.
Publicado: (2025)

Scalable Multilevel and Memetic Signed Graph Clustering
por: Hausberger, Felix, et al.
Publicado: (2022)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
por: Casel, Katrin, et al.
Publicado: (2019)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

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

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
por: Biedl, Therese, et al.
Publicado: (2024)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
por: Goyal, Dishant, et al.
Publicado: (2024)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
por: Assadi, Sepehr, et al.
Publicado: (2025)

Recovering Communities in Structured Random Graphs
por: Kapralov, Michael, et al.
Publicado: (2026)

Multi-View Structural Graph Summaries
por: Frank, Jonatan, et al.
Publicado: (2024)