Almost Tight Additive Guarantees for k-Edge-Connectivity
Bibliographic record
Abstract
We consider the $\boldsymbol{k}$-edge connected spanning subgraph (k-ECSS) problem, where we are given an undirected graph $G=(V, E)$ with nonnegative edge costs $\left\{c_{e}\right\}_{e \in E}$, and the goal is to find a minimum-cost subgraph H of G that is k edge connected, i.e., there exist at least k edge-disjoint paths between every pair of vertices in H. For even k, we present a polynomial time algorithm that computes a ($k-2$)-edge connected subgraph of cost at most that of the optimal k-edge connected subgraph of G; for odd k, we obtain a $(k-3)$ edge connected subgraph of cost at most the optimum. In fact, the cost of our solution does not exceed the optimal value, $\mathbf{L P}_{\boldsymbol{k} \text {-ECSSLP }}^{\boldsymbol{*}}$ of the natural LP-relaxation for $\boldsymbol{k}$-ECSS. Since k-ECSS is $A P X$-hard for all values of $k \geq 2$, our results are nearly optimal. They also significantly improve upon the recent work of Hershkowitz, Klein, and Zenklusen [1], both in terms of solution quality and the simplicity of algorithm and its analysis. Interestingly, our techniques also yield an alternate guarantee, where we obtain a($k-1$)-edge connected subgraph of cost at most $1.5 \cdot \mathrm{LP}_{\boldsymbol{k}-\mathrm{ECSSLP}}^{*}$; with unit edge costs, the cost guarantee improves to $\left(1+\frac{4}{3 k}\right) \cdot$ LP $_{\boldsymbol{k} \text {-ECSSLP }}^{\boldsymbol{*}}$, which improves upon the state-of-the-art approximation guarantee for unit edge costs [2], albeit with a unit loss in edge connectivity. Our k-ECSS-result also yields results for the k-edge connected spanning multigraph (k-ECSM) problem, where multiple copies of an edge can be selected. For $\boldsymbol{k}$-ECSM, we obtain a $\left(1+\frac{2}{k}\right)$-approximation algorithm for even k, and $\mathbf{a}\left(1+\frac{3}{k}\right)$ approximation algorithm for odd $\boldsymbol{k}$. Finally, our techniques extend to the degree-bounded versions of k-ECSS and k-ECSM, wherein we also impose degree lower- and upper- bounds on the nodes. Our results for k-ECSS and k-ECSM extend to yield the same cost and connectivity guarantees for these degree-bounded versions with an additive violation of (roughly) 2 for the degree bounds. These are the first results for degree-bounded $\{k$-ECSS, k-ECSM $\}$ of the form where the cost of the solution obtained is at most the optimum, and the connectivity constraints are violated by an additive constant. Work done while N. Kumar was a postdoc in the $C \& O$ department at the University of Waterloo. Supported in part by C. Swamy’s NSERC Discovery grant.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.023 |
| Meta-epidemiology (narrow) | 0.004 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.005 | 0.014 |
| Open science | 0.008 | 0.007 |
| Research integrity | 0.004 | 0.007 |
| Insufficient payload (model declined to judge) | 0.015 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".