首页/论文/cs/0409013

arXiv cs/04090132004-09-08cs.DScs.DM

图的局部连通生成树

Locally connected spanning trees on graphs

Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen

备注：: 14 pages, 3 figures

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

摘要：

图$G$的局部连通生成树是$G$的生成树$T$，使得$T$中$v$的所有邻居的集合对于每个$v\in V(G)$导出$G$的连通子图。本文的目的是给出分别在强弦图和真圆弧图上求局部连通生成树的线性时间算法。

英文摘要：

A locally connected spanning tree of a graph $G$ is a spanning tree $T$ of $G$ such that the set of all neighbors of $v$ in $T$ induces a connected subgraph of $G$ for every $v\in V(G)$. The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges

We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.

2016-09-01cs.DMcs.DSmath.CO

一种近似2-边连通生成子图和2-顶点连通生成子图的统一方法

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph

本文提出了一种统一方法，用于近似2-边连通和2-顶点连通生成子图问题，两者均达到4/3的近似比。

2026-07-21cs.DS

Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs

We present the first polynomial-time approximation schemes, i.e., (1 + ε)-approximation algorithm for any constant ε > 0, for the minimum three-edge connected spanning subgraph problem and the minimum three-vertex connected spanning subgraph problem in undirected planar graphs. Both the approximation schemes run in linear time.

2017-01-28cs.DS

Minimum $2$-vertex-twinless connected spanning subgraph problem

Given a $2$-vertex-twinless connected directed graph $G=(V,E)$, the minimum $2$-vertex-twinless connected spanning subgraph problem is to find a minimum cardinality edge subset $E^{t} \subseteq E$ such that the subgraph $(V,E^{t})$ is $2$-vertex-twinless connected. Let $G^{1}$ be a minimal $2$-vertex-connected subgraph of $G$. In this paper we present a $(2+a_{t}/2)$-approximation algorithm for the minimum $2$-vertex-twinless connected spanning subgraph problem, where $a_{t}$ is the number of twinless articulation points in $G^{1}$.

2020-01-11cs.DS

An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph

In the weighted minimum strongly connected spanning subgraph (WMSCSS) problem we must purchase a minimum-cost strongly connected spanning subgraph of a digraph. We show that half-integral linear program (LP) solutions for WMSCSS can be efficiently rounded to integral solutions at a multiplicative $1.5$ cost. This rounding matches a known $1.5$ integrality gap lower bound for a half-integral instance. More generally, we show that LP solutions whose non-zero entries are at least a value $f > 0$ can be rounded at a multiplicative cost of $2 - f$.

2020-11-11cs.DS

On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

Our motivation is to improve on the best approximation guarantee known for the problem of finding a minimum-cost 2-node connected spanning subgraph of a given undirected graph with nonnegative edge costs. We present an LP (Linear Programming) relaxation based on partition constraints. The special case where the input contains a spanning tree of zero cost is called 2NC-TAP. We present a greedy algorithm for 2NC-TAP, and we analyze it via dual-fitting for our partition LP relaxation. Keywords: 2-node connected graphs, approximation algorithms, connectivity augmentation, greedy algorithm, network…

2021-11-15cs.DS

更多相关论文收起更多论文

线性时间内求解 2-边连通图的低度生成树

Low-degree spanning trees of $2$-edge-connected graphs in linear time

针对 2-边连通图的低度生成树构造问题，提出一种简单线性时间算法，保证各顶点树度不超过其图度一半上取整加一。

2024-10-26cs.DS

A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3

We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Sebő and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17/12-approximation algorithm for this problem, and by Sebő and Vygen (Combinatorica 2014), who improved the approximation ratio to 4/3.

2017-01-17cs.DS

关于最小标号生成双连通子图问题

On the Minimum Labelling Spanning bi-Connected Subgraph problem

我们引入了最小标号生成双连通子图问题（MLSBP），它用双连通性取代了著名的最小标号生成树问题（MLSTP）中的连通性。一个图是双连通的，如果对于每两个顶点，至少有两条顶点不相交的路连接它们。问题在于寻找具有最小标签集的生成双连通子图或块。我们适应MLSTP的精确方法来解决MLSTB和基本的贪婪的建设性启发式，最大顶点覆盖算法（MVCA）。这一过程是应用元分析方法解决问题的一个基本组成部分。

2015-05-07cs.DSmath.OC

有向图2-边连通度的最小生成子图的逼近

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs

设$G$是一个强连通有向图.我们考虑以下三个问题，我们希望计算$G$的最小强连通生成子图，分别保持：$2$-$G$的边连通块（\textsf{2EC-B}）; $2$-$G$的边连通分量（\textsf{2EC-C}）; $2$-边连通块和$2$-$G$的边连通分量（\textsf{2EC-B-C}）。这三个问题都是NP难的，因此我们对有效的近似算法感兴趣。对于\textsf{2EC-C}，我们可以得到一个$3/2$-近似结合以前已知的结果。对于\textsf{2EC-B}和\textsf{2EC-B-C}，我们提出了新的$4$-近似算法，运行在线性时间。我们还提出了各种算法来提高实际计算子图的大小，并进行了彻底的实验研究，以评估其在实际场景中的优点。

2015-09-09cs.DS

最小 2-边连通生成子图问题的一种新近似算法

A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem

本文提出了一种新的近似算法，用于解决最小 2-边连通生成子图问题，其近似比为 4/3，并在子立方图上进一步优化为 6/5。

2026-07-21cs.DS

有向图中计算具有最少边数的2-T连通支撑子图问题

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs

本文研究给定2-T连通有向图，寻找边数最少的2-T连通支撑子图问题，并提出了一个多项式时间的4-近似算法。

2024-09-29cs.DS

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

In the $k$-edge-connected spanning subgraph ($k$ECSS) problem, our goal is to compute a minimum-cost sub-network that is resilient against up to $k$ link failures: Given an $n$-node $m$-edge graph with a cost function on the edges, our goal is to compute a minimum-cost $k$-edge-connected spanning subgraph. This NP-hard problem generalizes the minimum spanning tree problem and is the "uniform case" of a much broader class of survival network design problems (SNDP). A factor of two has remained the best approximation ratio for polynomial-time algorithms for the whole class of SNDP, even for a sp…

2022-05-30cs.DS

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum total edge cost in a graph. The algorithm maintains a spanning forest starting with an empty edge set. In each iteration, a new edge incident to a leaf is selected in a natural greedy manner and added to the forest. If this produces a cycle, this cycle is contracted. This growing phase ends when the graph has been contracted into a single node and a subsequent cleanup step removes redundant edges in reverse order. We analyze the algorithm using the primal-dual meth…

2018-11-20cs.DS

Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs

In the minimum $k$-edge-connected spanning subgraph ($k$-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to $k-1$ edge failures. This is a central problem in network design, and a natural generalization of the minimum spanning tree (MST) problem. While the MST problem has been studied extensively by the distributed computing community, for $k \geq 2$ less is known in the distributed setting. In this paper, we present fast randomized distributed approximation algorithms for $k$-ECSS in the CONGEST model. Our first contribution is an $\widetilde{O}(D + \sqrt{n})$-ro…

2018-05-20cs.DCcs.DS

A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$-Edge-Connected Spanning Subgraph

The minimum-cost $k$-edge-connected spanning subgraph ($k$-ECSS) problem is a generalization and strengthening of the well-studied minimum-cost spanning tree (MST) problem. While the round complexity of distributedly computing the latter has been well-understood, the former remains mostly open, especially as soon as $k\geq 3$. In this paper, we present the first distributed algorithm that computes an approximation of $k$-ECSS in sublinear time for general $k$. Concretely, we describe a randomized distributed algorithm that, in $\tilde{O}(k(D+k\sqrt{n}))$ rounds, computes a $k$-edge-connected s…

2022-11-09cs.DCcs.DS

Maximizing the Number of Spanning Trees in a Connected Graph

We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm that, using submodularity, obtains an approximation ratio of $(1 - 1/e - ε)$ in the exponent of the number of spanning trees for any $ε> 0$ in time $\tilde{O}(m ε^{-1} + (n + q) ε^{-3})$, where $m$ and $q$ is the number of edges in the original graph and the candidate edge set, respectively. Our running time is optimal with respect to the input size up to log…

2018-07-15cs.CCcs.DS

Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal Graphs

Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a key role in, e.g., network reliability under random edge failure, estimation over networks and D-optimal experimental designs. This paper tackles the open problem of designing graphs with the maximum weighted number of spanning trees under various constraints. We reveal several new structures, such as the log-submodularity of the weighted number of spanning t…

2016-04-12cs.DScs.SI