Imagen de Portada

The Connected k-Vertex One-Center Problem on Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zhang, Jingru
Formato:	Preprint
Publicado:	2024
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

The k-Center Problem of Uncertain Points on Graphs
por: Xu, Haitao, et al.
Publicado: (2025)

The Bichromatic Two-Center Problem on Graphs
por: Sun, Qi, et al.
Publicado: (2025)

The Two-Center Problem of Uncertain Points on Cactus Graphs
por: Xu, Haitao, et al.
Publicado: (2024)

The Two-Center Problem of Uncertain Points on Trees
por: Xu, Haitao, et al.
Publicado: (2024)

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

Computing the Center of Uncertain Points on Cactus Graphs
por: Hu, Ran, et al.
Publicado: (2024)

Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs
por: Daugulis, Peteris
Publicado: (2025)

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

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
por: Bai, Tian, et al.
Publicado: (2022)

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
por: Çivril, Ali
Publicado: (2024)

Beyond 2-approximation for k-Center in Graphs
por: Jin, Ce, et al.
Publicado: (2025)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

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

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

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
por: Bhanja, Koustav, et al.
Publicado: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
por: Li, Xizhe, et al.
Publicado: (2026)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
por: Lu, Qiheng, et al.
Publicado: (2025)

On Computing Vertex Connectivity of 1-Plane Graphs
por: Biedl, Therese, et al.
Publicado: (2022)

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

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
por: Long, Yaowei, et al.
Publicado: (2024)

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
por: Jiang, Yonggang, et al.
Publicado: (2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
por: Bentert, Matthias, et al.
Publicado: (2025)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
por: Goldmann, Lito, et al.
Publicado: (2023)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
por: Çivril, Ali
Publicado: (2023)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
por: Georgiadis, Loukas, et al.
Publicado: (2026)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
por: Neiman, Ofer, et al.
Publicado: (2026)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
por: Parter, Merav, et al.
Publicado: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
por: Kobayashi, Yusuke, et al.
Publicado: (2026)

Connectivity Oracles for Predictable Vertex Failures
por: Hu, Bingbing, et al.
Publicado: (2023)

On Parallel $k$-Center Clustering
por: Coy, Sam, et al.
Publicado: (2023)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
por: Balakrishnan, Girish, et al.
Publicado: (2024)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs
por: Chen, Yu, et al.
Publicado: (2024)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
por: Blikstad, Joakim, et al.
Publicado: (2025)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
por: Floros, Dimitris, et al.
Publicado: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
por: Bougeret, Marin, et al.
Publicado: (2025)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
por: Heck, Sophia, et al.
Publicado: (2026)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
por: Esmer, Barış Can, et al.
Publicado: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)