2-Edge-Connected Spanning Subgraph (2ECSS)

• 2ECSS is the problem of finding a minimum spanning subgraph that remains connected after removing any single edge, ensuring network robustness.
• Key methodologies include LP relaxations like the cut LP, primal-dual approaches, triangle-free 2-edge-covers, and gluing techniques to achieve tighter approximation ratios.
• Recent research highlights advances such as sub-5/4 approximations and refined 4-cycle analysis, while the weighted variant remains a significant open challenge.

Searching arXiv for recent and foundational papers on 2ECSS to ground the article in the cited literature. to=arxiv_search.search 天天中彩票在 微信天天中彩票 аԥсjson_string{"query":"2-edge-connected spanning subgraph problem approximation 2ECSS arXiv", "max_results": 10, "sort_by": "submittedDate", "sort_order": "descending"} is not a valid tool call Searching arXiv for “2-edge-connected spanning subgraph problem approximation” and related recent work. to=arxiv_search.search 天天中彩票公司 天天中彩票未json {"query":"2-edge-connected spanning subgraph approximation", "max_results": 10, "sort_by":"submittedDate", "sort_order":"descending"} to=arxiv_search 天天买彩票 ปมถวายสัตย์ code {"query":"2-edge-connected spanning subgraph approximation", "max_results": 10} The 2-Edge-Connected Spanning Subgraph problem (2ECSS) asks for a spanning subgraph of minimum size, or in weighted variants minimum cost, that remains connected after the removal of any single edge. In its standard approximation-theoretic form, the input is an undirected simple graph $G=(V,E)$, and the objective is to find a minimum-cardinality edge set $S\subseteq E$ such that $(V,S)$ is 2-edge-connected. The problem is fundamental in survivable network design, and it is both NP-hard and APX-hard in the unweighted simple-graph setting (Bosch-Calvo et al., 2024). A basic but essential distinction is that 2ECSS restricts solutions to simple subgraphs, whereas the closely related 2-edge-connected multisubgraph problem (2ECM) allows parallel edges; several strong LP-rounding results are known only in the multisubgraph setting and do not transfer directly to 2ECSS (Boyd et al., 2020).

1. Formal model and problem-theoretic position

A graph is 2-edge-connected if the deletion of any one edge leaves it connected. Accordingly, 2ECSS seeks a minimum-cardinality spanning subgraph with that property. In the weighted form, the objective is to minimize total edge cost rather than cardinality; in both forms, the problem is a canonical survivable network design problem (Bosch-Calvo et al., 2024).

The natural LP relaxation used throughout the literature is the cut LP: $\min \sum_{e\in E} x_e$ subject to

$$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$

$0 \le x_e \le 1 \qquad \forall\, e\in E.$

Its dual also plays a central role in primal-dual and dual-fitting analyses: $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$ subject to

$$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$

$y_S \ge 0,\quad z_e \ge 0.$

This formulation underlies both classical $4/3$-approximation analyses and later sub-$S\subseteq E$0 improvements (Çivril, 2024).

Several adjacent problems must be kept distinct. 2VCSS replaces edge-connectivity by vertex-connectivity. 2ECM allows multiedges and is substantially more amenable to splitting-off and half-integral LP arguments. Directed analogues further bifurcate into preserving 2-edge-connected blocks, preserving 2-edge-connected components, or maintaining strong connectivity with additional edge-disjointness properties; these directed problems are not straightforward orientations of the undirected theory (Georgiadis et al., 2015).

2. Approximation landscape on undirected simple graphs

The approximation history of unweighted 2ECSS is unusually long and technically layered. Early progress established a $S\subseteq E$1-approximation, then a $S\subseteq E$2-approximation, and later a $S\subseteq E$3-approximation, with Sebő and Vygen’s ear-decomposition-based analysis serving as the main benchmark for many years (Çivril, 2024). The first provable break below $S\subseteq E$4 came with a $S\subseteq E$5 approximation based on reduction to “structured graphs” that are “almost” 3-vertex-connected (Garg et al., 2022). That was followed by a $S\subseteq E$6-approximation using minimum triangle-free 2-edge-covers (Kobayashi et al., 2023), a $S\subseteq E$7-approximation based on segment-driven local improvements and a new primal-dual analysis (Çivril, 2024), and then $S\subseteq E$8-level algorithms based on more aggressive gluing mechanisms (Garg et al., 2024, Bosch-Calvo et al., 2024). A later paper breaks the $S\subseteq E$9 threshold and gives a deterministic $(V,S)$0-approximation for some constant $(V,S)$1 (Hommelsheim et al., 24 Sep 2025).

Representative milestones from the provided literature are as follows.

Paper	Guarantee	Main idea
"Improved Approximation for Two-Edge-Connectivity" (Garg et al., 2022)	$(V,S)$2	Structured-graph reduction
"An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover" (Kobayashi et al., 2023)	$(V,S)$3	Triangle-free 2-edge-cover
"9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity" (Çivril, 2024)	$(V,S)$4	Segment-based local improvements
"A $(V,S)$5-Approximation for Two-Edge Connectivity" (Bosch-Calvo et al., 2024)	$(V,S)$6	Structured reduction, canonical triangle-free cover, gluing
"A Better-Than-$(V,S)$7-Approximation for Two-Edge Connectivity" (Hommelsheim et al., 24 Sep 2025)	$(V,S)$8	Two-case analysis on 4-cycles

This progression also marks a change in the dominant proof architecture. Earlier $(V,S)$9-level methods relied heavily on ear decompositions or elaborate charging schemes. More recent algorithms combine lower bounds from 2-edge-covers, fine-grained preprocessing into structured instances, and component-gluing procedures that exploit matching properties or explicit local replacement rules. A plausible implication is that the modern frontier is less about a single global decomposition and more about how much additive augmentation beyond a carefully chosen lower-bound structure can be made unavoidable.

3. Dominant algorithmic paradigms

A major line of work develops primal-dual and local-improvement algorithms. One such algorithm achieves $\min \sum_{e\in E} x_e$0 on general graphs and $\min \sum_{e\in E} x_e$1 on subcubic graphs through a two-phase scheme: a naive primal-dual construction followed by three classes of local improvement operations involving critical edges and short segments (Çivril, 2019). A later unified local-search framework gives $\min \sum_{e\in E} x_e$2-approximations for both 2ECSS and 2VCSS by starting from an inclusion-wise minimal feasible solution, identifying strong short segments, recursively trying small “switches,” and certifying the resulting solution via a feasible dual assignment worth at least $\min \sum_{e\in E} x_e$3 of the solution size (Çivril, 2023).

A second paradigm uses triangle-free 2-edge-covers as the lower-bound object. In this approach, one first computes a minimum triangle-free 2-edge-cover, where every vertex has degree at least 2 and no connected component is a triangle. Hartvigsen’s polynomial-time algorithm for maximum triangle-free 2-matchings is used to move between triangle-free 2-matchings and triangle-free 2-edge-covers, with the relations

$\min \sum_{e\in E} x_e$4

After converting the cover into semi-canonical form, augmentation arguments yield a 2ECSS $\min \sum_{e\in E} x_e$5 with

$\min \sum_{e\in E} x_e$6

which leads to the $\min \sum_{e\in E} x_e$7-approximation (Kobayashi et al., 2023).

A third paradigm is the structured-graph reduction plus gluing framework. The $\min \sum_{e\in E} x_e$8 algorithm reduces general graphs to $\min \sum_{e\in E} x_e$9-structured graphs that are simple, 2-vertex-connected, sufficiently large, and free of several bad local configurations, including irrelevant edges and non-isolating 2-vertex cuts (Garg et al., 2022). The $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$0 “Pac-Man gluing” algorithm strengthens this philosophy by reducing to highly connected structured graphs with no large 3-vertex cuts, using the resulting 4-matching property across bipartitions of size at least 10 to glue a huge 2-edge-connected component to the remaining components (Garg et al., 2024). The exact $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$1-approximation refines the same template: reduction to structured instances, computation of a minimum canonical triangle-free 2-edge-cover, bridge covering, and then gluing of components under a credit invariant (Bosch-Calvo et al., 2024).

Breaking the $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$2 barrier requires a qualitatively new idea. The better-than-$$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$3 algorithm observes that $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$4-cycles are the obstruction: for $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$5, a $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$6-cycle in the 2-edge cover can “buy” one additional edge, but this fails immediately below $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$7. The paper therefore gives two complementary algorithms, one for few $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$8-cycles and one for many $$\sum_{e\in \delta(S)} x_e \ge 2 \qquad \forall\, \emptyset \subset S \subset V,$$9-cycles, and introduces colorful bridge covering, rich vertices, and branching gluing paths to make the accounting work below the prior threshold (Hommelsheim et al., 24 Sep 2025). This suggests that sub-$0 \le x_e \le 1 \qquad \forall\, e\in E.$0 progress depends not merely on stronger preprocessing, but on non-uniform credit management keyed to the short-cycle profile of the lower-bound cover.

4. LP relaxations, convex combinations, and special graph classes

Although the best approximation ratios for unweighted simple graphs are driven by combinatorial constructions, convex-combination and LP arguments remain central, especially on special graph classes. For 3-edge-connected cubic graphs, every graph $0 \le x_e \le 1 \qquad \forall\, e\in E.$1 with $0 \le x_e \le 1 \qquad \forall\, e\in E.$2 has a 2-edge-connected spanning subgraph with at most $0 \le x_e \le 1 \qquad \forall\, e\in E.$3 edges (Legault, 2017). The key technical statement is that the all-$0 \le x_e \le 1 \qquad \forall\, e\in E.$4 vector

$0 \le x_e \le 1 \qquad \forall\, e\in E.$5

is a convex combination of incidence vectors of 2-edge-connected spanning subgraphs. Since cubic graphs satisfy $0 \le x_e \le 1 \qquad \forall\, e\in E.$6, averaging yields a subgraph with at most

$0 \le x_e \le 1 \qquad \forall\, e\in E.$7

edges. This improves the previous $0 \le x_e \le 1 \qquad \forall\, e\in E.$8 upper bound for this class and gives an upper bound of $0 \le x_e \le 1 \qquad \forall\, e\in E.$9 on the unit integrality gap there (Legault, 2017).

The minimum-cost 2EC and 2ECM literature provides adjacent LP insights but must be interpreted carefully. For a family of half-integer “half-triangle” LP solutions, one paper proves the conjectured $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$0 integrality-gap bound by constructing convex combinations of integer 2-edge-connected spanning multi-subgraphs: $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$1 This is a result about the multisubgraph/cost setting rather than simple-graph 2ECSS, but it is highly relevant to the general LP landscape (Boyd et al., 2015). Likewise, for half-integral solutions to the LP for 2ECM, there is a simpler proof of the $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$2 integrality-gap upper bound together with a deterministic $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$3-time $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$4-approximation algorithm, based on an extension of Lovász’s splitting-off theorem. The paper explicitly notes that the method does not generalize to 2ECSS because it crucially relies on allowing parallel edges (Boyd et al., 2020).

These results jointly clarify a recurrent misconception: strong LP decompositions in the multigraph setting do not automatically imply analogous decompositions for simple subgraphs. The simple-subgraph restriction is not a minor modeling choice; it blocks splitting-off and multiplicity-based rounding arguments that are natural in 2ECM.

5. Weighted, metric, and distributed variants

For general edge costs, the approximation picture is weaker than for the unweighted problem. A 2022 paper states that a factor of two remained the best approximation ratio for polynomial-time algorithms for the whole class of survivable network design problems, even for the special case of 2ECSS, and develops a near-linear-time LP solver that yields a $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$5-approximation in time

$$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$6

for $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$7 (Chalermsook et al., 2022). An earlier primal-dual algorithm gives a conceptually simple 3-approximation for the weighted problem, with a single growing phase and running time $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$8 (Beyer et al., 2018). The contrast with the unweighted $$\max \sum_{\emptyset \subset S \subset V} 2y_S - \sum_{e\in E} z_e$$9-level results is sharp, and one paper explicitly states that finding a better than 2 approximation for weighted 2ECSS remains a major open problem (Bosch-Calvo et al., 2024).

In geometric settings, the problem can become much more tractable. For metric spaces of bounded doubling dimension, there is a polynomial-time randomized $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$0-approximation algorithm for minimum-weight 2ECSS based on randomized hierarchical decompositions, portals, sparse/dense decomposition, patching, and dynamic programming (Hung, 2012). This is a PTAS for fixed doubling dimension and fixed $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$1.

The distributed literature studies minimum-weight 2ECSS in the CONGEST model. One paper gives an $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$2-approximation in $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$3 rounds with high probability for weighted 2ECSS, via reduction to tree augmentation, a greedy set-cover-style augmentation process, and MST segment decomposition (Dory, 2018). Another provides the first deterministic distributed constant approximation in nearly optimal time, namely a $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$4-approximation in $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$5 rounds, again by reducing to weighted tree augmentation and simulating a set-cover process (Dory et al., 2019). A later general $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$6-ECSS framework yields an $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$7-approximation for $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$8 in $$\sum_{S: e\in \delta(S)} y_S \le 1+z_e \qquad \forall\, e\in E,$$9 rounds, nearly matching the known lower-bound scale (Dory et al., 2022).

6. Related formulations, structural results, and open directions

The undirected simple-graph problem sits inside a broader family of edge-connectivity questions. In directed graphs, the relevant sparsification objectives split into preserving 2-edge-connected blocks, preserving 2-edge-connected components, or preserving both. For these digraph problems, new linear-time 4-approximation algorithms are known for preserving blocks and for preserving both blocks and components, while a $y_S \ge 0,\quad z_e \ge 0.$0-approximation can be obtained for the component-only variant by combining previous results (Georgiadis et al., 2015). This divergence reinforces that directed 2-edge-connectivity is structurally different from the undirected 2ECSS problem.

Structural graph theory provides complementary existence theorems. One result shows that every 6-connected and essentially 8-connected graph contains a spanning tree $y_S \ge 0,\quad z_e \ge 0.$1 such that $y_S \ge 0,\quad z_e \ge 0.$2 is 2-connected, improving earlier sufficient conditions for leaving a 2-connected spanning remainder after deleting a tree (Gu, 2014). Another line studies spanning $y_S \ge 0,\quad z_e \ge 0.$3-tree-connected subgraphs with bounded degrees; for $y_S \ge 0,\quad z_e \ge 0.$4, the results are presented as degree-bounded existence criteria for spanning 2-edge-connected subgraphs under edge-connectivity, toughness-type, and forbidden-subgraph assumptions (Hasanvand, 2022). These papers are not approximation algorithms for 2ECSS, but they identify connectivity regimes where feasibility with additional structure is guaranteed.

Several open directions emerge consistently across the literature. One is the persistent weighted gap: the unweighted problem has moved from $y_S \ge 0,\quad z_e \ge 0.$5 to $y_S \ge 0,\quad z_e \ge 0.$6 and beyond, whereas the weighted case still lacks any better-than-2 approximation guarantee in the general setting (Chalermsook et al., 2022, Bosch-Calvo et al., 2024). A second is the LP integrality-gap program: the $y_S \ge 0,\quad z_e \ge 0.$7 conjecture is proved for half-triangle solutions in the multisubgraph setting, but not for all cost functions or all LP optima (Boyd et al., 2015). A third is methodological: the recent sub-$y_S \ge 0,\quad z_e \ge 0.$8 algorithm shows that the abundance or scarcity of $y_S \ge 0,\quad z_e \ge 0.$9-cycles in a canonical triangle-free 2-edge-cover is a decisive parameter, which suggests that future advances may depend on sharper lower bounds for $4/3$0-cycle-free 2-edge covers or on still more refined gluing primitives (Hommelsheim et al., 24 Sep 2025).