scientific article; zbMATH DE number 1305417
From MaRDI portal
Publication:4252299
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(29)- On k-connectivity problems with sharpened triangle inequality
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- Approximating minimum-cost graph problems with spanning tree edges
- On PTAS for the geometric maximum connected k-factor problem
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
- scientific article; zbMATH DE number 1670876 (Why is no real title available?)
- scientific article; zbMATH DE number 6696497 (Why is no real title available?)
- Approximation schemes for capacitated geometric network design
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Strongly connected spanning subgraph for almost symmetric networks
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- scientific article; zbMATH DE number 1223730 (Why is no real title available?)
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- A PTAS for three-edge-connected survivable network design in planar graphs
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- A constant factor approximation for minimum -edge-connected k-subgraph with metric costs
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
- Probabilistic properties of highly connected random geometric graphs
- Correlation clustering and two-edge-connected augmentation for planar graphs
- A 4/3 approximation for 2-vertex-connectivity
- An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Some problems in distributed computational geometry
- Improved approximations for flexible network design
- Bicriteria approximation for k-edge-connectivity
- Approximation schemes for planar graph connectivity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252299)
