On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
From MaRDI portal
Publication:1789587
DOI10.1007/s10287-016-0260-7zbMath1407.90241OpenAlexW2463317516MaRDI QIDQ1789587
Publication date: 10 October 2018
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-016-0260-7
Cites Work
- Unnamed Item
- 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
- Survivable networks, linear programming relaxations and the parsimonious property
- A factor 2 approximation algorithm for the generalized Steiner network problem
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- New branch-and-bound algorithms for k-cardinality tree problems
- Approximating the smallest k -edge connected spanning subgraph by LP-rounding
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- On the Structure of Minimum-Weight k-Connected Spanning Networks
- Survivable Network Design with Degree or Order Constraints
- Saving an epsilon
- The minimum augmentation of any graph to aK-edge-connected graph
- Approximation Algorithms for Several Graph Augmentation Problems
- Biconnectivity approximations and graph carvings
- Strong formulations for network design problems with connectivity requirements
- Reducibility among Combinatorial Problems
- Obtaining optimal k -cardinality trees fast
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
This page was built for publication: On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem