scientific article; zbMATH DE number 1263259
From MaRDI portal
Publication:4234131
zbMath0942.68651MaRDI QIDQ4234131
Publication date: 3 August 2000
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) Connectivity (05C40)
Related Items (10)
A data structure for bicategories, with application to speeding up an approximation algorithm ⋮ Primal-dual approximation algorithms for feedback problems in planar graphs ⋮ A primal-dual approximation algorithm for generalized Steiner network problems ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Unnamed Item ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs ⋮ An approximation algorithm for minimum-cost vertex-connectivity problems ⋮ A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs ⋮ A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs ⋮ An efficient approximation algorithm for the survivable network design problem
This page was built for publication:
