On the minimum-cost -edge-connected k-subgraph problem
From MaRDI portal
(Redirected from Publication:1789587)
On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
Recommendations
- A constant factor approximation for minimum \(\lambda \)-edge-connected \(k\)-subgraph with metric costs
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
- The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- scientific article; zbMATH DE number 764407
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Approximation Algorithms for Several Graph Augmentation Problems
- Biconnectivity approximations and graph carvings
- New branch-and-bound algorithms for \(k\)-cardinality tree problems
- Obtaining optimal \(k\)-cardinality trees fast
- On the Structure of Minimum-Weight k-Connected Spanning Networks
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- Reducibility among combinatorial problems
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- Solving the connected dominating set problem and power dominating set problem by integer programming
- Strong formulations for network design problems with connectivity requirements
- Survivable network design with degree or order constraints
- Survivable networks, linear programming relaxations and the parsimonious property
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- The minimum augmentation of any graph to aK-edge-connected graph
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Cited in
(5)- On the \(k\)-edge-incident subgraph problem and its variants
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- A constant factor approximation for minimum \(\lambda \)-edge-connected \(k\)-subgraph with metric costs
This page was built for publication: On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789587)
