Improved Approximation Algorithms for Uniform Connectivity Problems
From MaRDI portal
Recommendations
Cited in
(35)- Approximating unweighted connectivity problems in parallel
- scientific article; zbMATH DE number 2119765 (Why is no real title available?)
- Approximation algorithms for connected graph factors of minimum weight
- Improved approximation algorithms for single-tiered relay placement
- Power optimization for connectivity problems
- An approximation algorithm for minimum-cost vertex-connectivity problems
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- Approximating Steiner trees and forests with minimum number of Steiner points
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Approximating Steiner trees and forests with minimum number of Steiner points
- Relay placement for two-connectivity
- Faster approximation algorithms for weighted triconnectivity augmentation problems
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- A 4+ approximation for k-connected subgraphs
- On k-connectivity problems with sharpened triangle inequality
- Improved approximation algorithms for min-cost connectivity augmentation problems
- scientific article; zbMATH DE number 1817738 (Why is no real title available?)
- Performance guarantees for the TSP with a parameterized triangle inequality
- An approximate algorithm for finding a maximum-weight d-homogeneous connected spanning subgraph in a complete graph with random edge weights
- An improvement on Łuczak's connected matchings method
- Approximating subset \(k\)-connectivity problems
- Approximating minimum size \{1,2\}-connected networks
- Algorithms – ESA 2005
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality.
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Parameterized algorithms for node connectivity augmentation problems
- scientific article; zbMATH DE number 1670876 (Why is no real title available?)
- Degree constrained node-connectivity problems
- Matroidal degree-bounded minimum spanning trees
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Approximation algorithms for k-connected graph factors
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
This page was built for publication: Improved Approximation Algorithms for Uniform Connectivity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895812)
