2-node-connectivity network design (Q6122594)

From MaRDI portal

Revision as of 18:39, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: 2-node-connectivity network design

scientific article; zbMATH DE number 7811869

Language	Label	Description	Also known as
English	2-node-connectivity network design	scientific article; zbMATH DE number 7811869

Statements

scholarly article

0 references

2-node-connectivity network design (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

1 March 2024

0 references

zbMATH Keywords

2-connectivity

0 references

dominating set

0 references

approximation algorithm

0 references

symmetric crossing family

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2023.114367

0 references

Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs

0 references

Node connectivity augmentation via iterative randomized rounding

0 references

Parameterized Algorithms to Preserve Connectivity

0 references

Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems

0 references

A polylogarithmic approximation algorithm for 2-edge-connected dominating set

0 references

Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree

0 references

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches

0 references

Pruning 2-connected graphs

0 references

0 references

On the integrality ratio for tree augmentation

0 references

A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

0 references

0 references

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

0 references

0 references

Coverings and structure of crossing families

0 references

Approximation Algorithms for Several Graph Augmentation Problems

0 references

Approximation algorithms for highly connected multi-dominating sets in unit disk graphs

0 references

Improved approximation for tree augmentation: saving by rewiring

0 references

Approximation algorithms for connected dominating sets

0 references

Improved methods for approximating node weighted Steiner trees and connected dominating sets.

0 references

0 references

Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph

0 references

Approximation Algorithms for Graph Augmentation

0 references

A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees

0 references

A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2

0 references

Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen

0 references

Covering a laminar family by leaf to leaf links

0 references

An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

0 references

On the tree augmentation problem

0 references

2-node-connectivity network design

0 references

Approximating k-Connected m-Dominating Sets

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2023.114367

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6122594

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6122594&oldid=39712728"