scientific article; zbMATH DE number 1305417
From MaRDI portal
Publication:4252299
zbMath0974.68156MaRDI QIDQ4252299
Publication date: 18 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (12)
Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs ⋮ Approximation Schemes for Capacitated Geometric Network Design ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality ⋮ Some problems in distributed computational geometry ⋮ The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search ⋮ On \(k\)-connectivity problems with sharpened triangle inequality ⋮ Probabilistic properties of highly connected random geometric graphs ⋮ Strongly Connected Spanning Subgraph for Almost Symmetric Networks
This page was built for publication:
